EUDML | Colouring the petals of a graph.

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Colouring the petals of a graph.”

Some remarks on Eulerian graphs

Bohdan Zelinka (1979)

Czechoslovak Mathematical Journal

Similarity:

Characterization of magic graphs

Samuel Jezný, Marián Trenkler (1983)

Czechoslovak Mathematical Journal

Similarity:

Glossary of signed and gain graphs and allied areas.

Zaslavsky, Thomas (1998)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Chromatic index of finite and infinite graphs

Juraj Bosák (1972)

Czechoslovak Mathematical Journal

Similarity: