EUDML | Edge and vertex operations on upper embeddable graphs

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

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Edge and vertex operations on upper embeddable graphs”

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:

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

Ladislav Nebeský (1985)

Czechoslovak Mathematical Journal

Similarity: