EUDML | On upper embeddability of complementary graphs

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

Displaying similar documents to “On upper embeddability of complementary graphs”

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

Ladislav Nebeský (1985)

Czechoslovak Mathematical Journal

Similarity:

A note on upper embeddable graphs

Ladislav Nebeský (1983)

Czechoslovak Mathematical Journal

Similarity:

A new characterization of the maximum genus of a graph

Ladislav Nebeský (1981)

Czechoslovak Mathematical Journal

Similarity:

Edge and vertex operations on upper embeddable graphs

Hung-Lin Fu, Ming-Chun Tsai (1996)

Mathematica Slovaca

Similarity: