EUDML | On 2-cell embeddings of graphs with minimum numbers of regions

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

Displaying similar documents to “On 2-cell embeddings of graphs with minimum numbers of regions”

A new characterization of the maximum genus of a graph

Ladislav Nebeský (1981)

Czechoslovak Mathematical Journal

Similarity:

A note on upper embeddable graphs

Ladislav Nebeský (1983)

Czechoslovak Mathematical Journal

Similarity:

On upper embeddability of complementary graphs

Ladislav Nebeský (1983)

Časopis pro pěstování matematiky

Similarity: