Maximum genus and connectivity

DOI10.1016/0012-365X(94)00336-HzbMath0843.05019MaRDI QIDQ1910565

Jonathan L. Gross, Dan S. Archdeacon, Jian'er Chen

Publication date: 25 March 1996

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

zbMATH Keywords

connectivityboundsimplicial graphmaximum genusconnected graphscycle rank

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items (16)

Upper embeddability of graphs ⋮ Algorithmic graph embeddings ⋮ New bounds for the average genus and average number of faces of a simple graph ⋮ Maximum genus and chromatic number of graphs ⋮ Algorithmic graph embeddings ⋮ On the lower bounds for the maximum genus for simple graphs ⋮ The maximum genus of a 3-regular simplicial graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Maximum genus, girth and connectivity ⋮ The maximum genus of graphs with diameter three ⋮ Maximum genus and girth of graphs ⋮ Maximum genus, connectivity and minimal degree of graphs ⋮ A note on the maximum genus of 3-edge-connected nonsimple graphs ⋮ Lower bounds on the maximum genus of loopless multigraphs ⋮ A tight lower bound on the maximum genus of a 3-connected loopless multigraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
• Kuratowski-type theorems for average genus
• How to determine the maximum genus of a graph
• Bounds of the number of disjoint spanning trees
• A tight lower bound on the maximum genus of a simplicial graph
• On the average genus of a graph
• Sur un Theoreme Min-Max En Theorie Des Graphes (D'Après L. Nebeský)
• Hierarchy for imbedding-distribution invariants of a graph
• A new characterization of the maximum genus of a graph
• A Characterization in of Upper-Embeddable Graphs

This page was built for publication: Maximum genus and connectivity