A Kuratowski-type theorem for the maximum genus of a graph
From MaRDI portal
Publication:2546205
DOI10.1016/0095-8956(72)90040-8zbMath0217.02301OpenAlexW2032762856MaRDI QIDQ2546205
Richard D. Ringeisen, B. M. Stewart, E. A. Nordhaus, Arthur T. White
Publication date: 1972
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(72)90040-8
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
On the average crosscap number. II: Bounds for a graph ⋮ Bounds for the average genus of the vertex-amalgamation of graphs ⋮ A tight lower bound on the maximum genus of a simplicial graph ⋮ A note on disjoint cycles ⋮ Genus polynomials of ladder-like sequences of graphs ⋮ Hierarchy for imbedding-distribution invariants of a graph ⋮ Characterization of signed graphs which are cellularly embeddable in no more than one surface ⋮ Up-embeddability of a graph by order and girth ⋮ The geodesic-transversal problem ⋮ A new characterization of the maximum genus of a graph ⋮ Structure for a graph with average genus ⋮ The total embedding distributions of cacti and necklaces ⋮ An additivity theorem for maximum genus of a graph ⋮ How to determine the maximum genus of a graph ⋮ Upper-embeddable graphs and related topics ⋮ Sulla tracciabilita' di grafi finiti su superficie compatte ⋮ Survey of results on the maximum genus of a graph ⋮ On 2-cell embeddings of graphs with minimum numbers of regions ⋮ The embeddings of a graph—A survey ⋮ A Nebeský-type characterization for relative maximum genus ⋮ Maximum genus, girth and connectivity ⋮ Graphs of given genus and arbitrarily large maximum genus ⋮ Nonorientable genera of Petersen powers ⋮ The maximum genus, matchings and the cycle space of a graph
Cites Work
