Uniqueness and minimality of large face-width embeddings of graphs

DOI10.1007/BF01192526zbMath0838.05041MaRDI QIDQ1906851

Bojan Mohar

Publication date: 30 May 1996

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

surfaceembeddinggenusface-widthWhitney equivalence

Mathematics Subject Classification ID

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

Related Items (8)

Unnamed Item ⋮ Flexibility of projective-planar embeddings ⋮ Some recent progress and applications in graph minor theory ⋮ Blocking nonorientability of a surface ⋮ On the flexibility of toroidal embeddings ⋮ Re-embedding structures of 4-connected projective-planar graphs ⋮ Face covers and the genus problem for apex graphs ⋮ Flexibility of polyhedral embeddings of graphs in surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Densely embedded graphs
• Embeddings of graphs with no short noncontractible cycles
• Combinatorial Local Planarity and the Width of Graph Embeddings
• How to Draw a Graph

This page was built for publication: Uniqueness and minimality of large face-width embeddings of graphs