Densely embedded graphs

DOI10.1016/0095-8956(92)90064-5zbMath0694.05024OpenAlexW2007513443MaRDI QIDQ908930

Dan S. Archdeacon

Publication date: 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(92)90064-5

zbMATH Keywords

mapstriangulationsface-widthgraph embeddingdensely embedded graphs

Mathematics Subject Classification ID

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

Related Items (11)

Unnamed Item ⋮ Trading crossings for handles and crosscaps ⋮ Uniqueness and minimality of large face-width embeddings of graphs ⋮ A simple construction of high representativity triangulations ⋮ Planar graphs on the projective plane ⋮ Unnamed Item ⋮ On the uniqueness of kernels ⋮ Generating locally-cyclic triangulations of surfaces ⋮ Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial ⋮ Flexibility of polyhedral embeddings of graphs in surfaces ⋮ Embeddings of graphs

Cites Work

• Embeddings of graphs with no short noncontractible cycles
• Minimal triangulations on orientable surfaces
• Clean triangulations
• Self-dual orientable embedding of \(K_n\)
• Genus embeddings for some complete tripartite graphs
• Self-dual embeddings of Cayley graphs
• Computing the orientable genus of projective graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Densely embedded graphs