A note on upper embeddable graphs

DOI10.21136/cmj.1983.101853zbMath0518.05029OpenAlexW2294391594MaRDI QIDQ3666871

Ladislav Nebeský

Publication date: 1983

Full work available at URL: https://eudml.org/doc/13359

zbMATH Keywords

orientable surfaceabsolutely upper embeddableoddly n-edge-connected

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs ⋮ The maximum genus of vertex-transitive graphs ⋮ Unnamed Item ⋮ Bidirectional retracting-free double tracings and upper embeddability of graphs ⋮ Unnamed Item ⋮ Face size and the maximum genus of a graph. I: Simple graphs

Cites Work

• How to determine the maximum genus of a graph
• Upper embeddability and connectivity of graphs
• On the maximum genus of a graph
• A new characterization of the maximum genus of a graph
• A Characterization in of Upper-Embeddable Graphs
• Survey of results on the maximum genus of a graph
• Unnamed Item

This page was built for publication: A note on upper embeddable graphs