The maximum genus of graphs of diameter two

DOI10.1016/0012-365X(91)90046-5zbMath0724.05021MaRDI QIDQ2276970

Martin Škoviera

Publication date: 1991

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

maximum genus2-cell imbeddingupper imbeddable

Mathematics Subject Classification ID

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

Related Items (14)

Minimum genus embeddings of the complete graph ⋮ A tight lower bound on the maximum genus of a simplicial graph ⋮ Upper embeddability of graphs ⋮ Maximum genus and chromatic number of graphs ⋮ A sufficient condition on upper embeddability of graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Up-embeddability via girth and the degree-sum of adjacent vertices ⋮ The maximum genus of graphs with diameter three ⋮ Maximum genus, connectivity and minimal degree of graphs ⋮ Face size and the maximum genus of a graph. I: Simple graphs ⋮ Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)

Cites Work

• Unnamed Item
• How to determine the maximum genus of a graph
• Upper-embeddable graphs and related topics
• Bounds of the number of disjoint spanning trees
• 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

This page was built for publication: The maximum genus of graphs of diameter two