Miroslawa Skowronska

According to our database, Miroslawa Skowronska authored at least 6 papers between 1984 and 2000.

Collaborative distances:

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

2000

Minimal reducible bounds for 1-nonouterplanar graphs.

Mieczyslaw Borowiecki, Mariusz Haluszczak, Miroslawa Skowronska

Discret. Math., 2000

1999

Hamiltonicity of Amalgams.

Arthur M. Farley, Andrzej Proskurowski, Miroslawa Skowronska, Maciej M. Syslo

Graphs Comb., 1999

1990

Dominating cycles in halin graphs.

Miroslawa Skowronska, Maciej M. Syslo

Discret. Math., 1990

1988

The binding number of Halin graphs.

Miroslawa Skowronska

Discret. Appl. Math., 1988

1986

An Algorithmic Characterization of Total Digraphs.

Miroslawa Skowronska, Maciej M. Syslo, Christina Zamfirescu

J. Algorithms, 1986

1984

An algorithm to recognize a middle graph.

Miroslawa Skowronska, Maciej M. Syslo

Discret. Appl. Math., 1984