Krystyna T. Balinska

11 papers Journal 11
YearRankTypeTitle / Venue / Authors
2014 J jnl
The Maximum Number Of One-Edge Extensions For Graphs With Bounded Degree.
Ars Comb.
Krystyna T. Balinska, Louis V. Quintas, Krzysztof Zwierzynski
2006 J jnl
Extremal Size In Graphs With Bounded Degree.
Ars Comb.
Krystyna T. Balinska, Louis V. Quintas, Krzysztof Zwierzynski
2004 J jnl
Which non-regular bipartite integral graphs with maximum degree four do not have pm1 as eigenvalues?
Discret. Math.
Krystyna T. Balinska, Slobodan K. Simic, Krzysztof T. Zwierzyski
2001 J jnl
The nonregular, bipartite, integral graphs with maximum degree 4. Part I: basic properties.
Discret. Math.
Krystyna T. Balinska, Slobodan K. Simic
2000 J jnl
Results and Problems Concerning Edge Transformed Graphs.
Electron. Notes Discret. Math.
Krystyna T. Balinska, Louis V. Quintas
1996 J jnl
A Kinetic Approach to the Random F-graph Process. Paths, Cycles and Components.
Discret. Appl. Math.
Krystyna T. Balinska, Henryk Galina, Louis V. Quintas, Jerzy Szymanski
1996 J jnl
A Kinetic Approach to the Random f-Graph Process with Nonuniform Edge Probabilities.
J. Chem. Inf. Comput. Sci.
Krystyna T. Balinska, Henryk Galina, Louis V. Quintas, Jerzy Szymanski
1996 J jnl
Degrees in a digraph whose nodes are graphs.
Discret. Math.
Krystyna T. Balinska, Louis V. Quintas
1994 J jnl
Random Recursive Forests.
Random Struct. Algorithms
Krystyna T. Balinska, Louis V. Quintas, Jerzy Szymanski
1993 J jnl
The sequential generation of random f-graphs. distributions and predominant types of edge maximal f-graphs with f>;4.
Discret. Math.
Krystyna T. Balinska, Louis V. Quintas
1990 J jnl
The sequential generation of random f-graphs. Line maximal 2-, 3- and 4-graphs.
Comput. Chem.
Krystyna T. Balinska, Louis V. Quintas