Krystyna T. Balinska - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

2014

The Maximum Number Of One-Edge Extensions For Graphs With Bounded DegreeKrystyna T. Balinska, Louis V. Quintas, Krzysztof Zwierzynski. arscom, 115:101-114, 2014.

2006

Extremal Size In Graphs With Bounded DegreeKrystyna T. Balinska, Louis V. Quintas, Krzysztof Zwierzynski. arscom, 81, 2006.

2004

Which non-regular bipartite integral graphs with maximum degree four do not have pm1 as eigenvalues?Krystyna T. Balinska, Slobodan K. Simic, Krzysztof T. Zwierzyski. DM, 286(1-2):15-24, 2004. [doi]

2001

The nonregular, bipartite, integral graphs with maximum degree 4. Part I: basic propertiesKrystyna T. Balinska, Slobodan K. Simic. DM, 236(1-3):13-24, 2001. [doi]

2000

Results and Problems Concerning Edge Transformed GraphsKrystyna T. Balinska, Louis V. Quintas. endm, 5:11-14, 2000. [doi]

1996

A Kinetic Approach to the Random F-graph Process. Paths, Cycles and ComponentsKrystyna T. Balinska, Henryk Galina, Louis V. Quintas, Jerzy Szymanski. DAM, 67(1-3):13-25, 1996. [doi]

Degrees in a digraph whose nodes are graphsKrystyna T. Balinska, Louis V. Quintas. DM, 150(1-3):17-29, 1996. [doi]

A Kinetic Approach to the Random f-Graph Process with Nonuniform Edge ProbabilitiesKrystyna T. Balinska, Henryk Galina, Louis V. Quintas, Jerzy Szymanski. jcisd, 36(3):347-350, 1996. [doi]

1994

Random Recursive ForestsKrystyna T. Balinska, Louis V. Quintas, Jerzy Szymanski. rsa, 5(1):3-12, 1994.

1993

The sequential generation of random f-graphs. distributions and predominant types of edge maximal f-graphs with f>;4Krystyna T. Balinska, Louis V. Quintas. DM, 114(1-3):19-22, 1993. [doi]

1990

The sequential generation of random f-graphs. Line maximal 2-, 3- and 4-graphsKrystyna T. Balinska, Louis V. Quintas. CANDC, 14(4):323-328, 1990. [doi]

Sign in or sign up to see more results.

runs on WebDSL