Krystyna T. Balinska

According to our database, Krystyna T. Balinska authored at least 11 papers between 1990 and 2014.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2014

The Maximum Number Of One-Edge Extensions For Graphs With Bounded Degree.

Krystyna T. Balinska, Louis V. Quintas, Krzysztof Zwierzynski

Ars Comb., 2014

2006

Extremal Size In Graphs With Bounded Degree.

Krystyna T. Balinska, Louis V. Quintas, Krzysztof Zwierzynski

Ars Comb., 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

Discret. Math., 2004

2001

The nonregular, bipartite, integral graphs with maximum degree 4. Part I: basic properties.

Krystyna T. Balinska, Slobodan K. Simic

Discret. Math., 2001

2000

Results and Problems Concerning Edge Transformed Graphs.

Krystyna T. Balinska, Louis V. Quintas

Electron. Notes Discret. Math., 2000

1996

A Kinetic Approach to the Random f-Graph Process with Nonuniform Edge Probabilities.

Krystyna T. Balinska, Henryk Galina, Louis V. Quintas, Jerzy Szymanski

J. Chem. Inf. Comput. Sci., 1996

Degrees in a digraph whose nodes are graphs.

Krystyna T. Balinska, Louis V. Quintas

Discret. Math., 1996

A Kinetic Approach to the Random F-graph Process. Paths, Cycles and Components.

Krystyna T. Balinska, Henryk Galina, Louis V. Quintas, Jerzy Szymanski

Discret. Appl. Math., 1996

1994

Random Recursive Forests.

Krystyna T. Balinska, Louis V. Quintas, Jerzy Szymanski

Random Struct. Algorithms, 1994

1993

The sequential generation of random f-graphs. distributions and predominant types of edge maximal f-graphs with f>;4.

Krystyna T. Balinska, Louis V. Quintas

Discret. Math., 1993

1990

The sequential generation of random f-graphs. Line maximal 2-, 3- and 4-graphs.

Krystyna T. Balinska, Louis V. Quintas

Comput. Chem., 1990