An algorithm to recognize a middle graph. - Miroslawa Skowronska; Maciej M. Syslo (Discret. Appl. Math., 1984)

An Algorithmic Characterization of Total Digraphs. - Miroslawa Skowronska; Maciej M. Syslo; Christina Zamfirescu (J. Algorithms, 1986)

The binding number of Halin graphs. - Miroslawa Skowronska (Discret. Appl. Math., 1988)

Dominating cycles in halin graphs. - Miroslawa Skowronska; Maciej M. Syslo (Discret. Math., 1990)

Hamiltonicity of Amalgams. - Arthur M. Farley; Andrzej Proskurowski; Miroslawa Skowronska; Maciej M. Syslo (Graphs Comb., 1999)

Minimal reducible bounds for 1-nonouterplanar graphs. - Mieczyslaw Borowiecki; Mariusz Haluszczak; Miroslawa Skowronska (Discret. Math., 2000)