A Kuratowski-type theorem for the maximum genus of a graph

DOI10.1016/0095-8956(72)90040-8MaRDI QIDQ2546205zbMATH OpenOpenAlexFDO

Authors E. A. Nordhaus, Richard D. Ringeisen, B. M. Stewart, 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

Mathematics Subject Classification ID

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

Cites work

• Additivity of the genus of a graph
• scientific article; zbMATH DE number 3179262 (Why is no real title available?)
• scientific article; zbMATH DE number 3641446 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• On the maximum genus of a graph
• The Genus, Regional Number, and Betti Number of a Graph

Cited in

(24)

• Characterization of signed graphs which are cellularly embeddable in no more than one surface
• An additivity theorem for maximum genus of a graph
• How to determine the maximum genus of a graph
• Upper-embeddable graphs and related topics
• A Nebeský-type characterization for relative maximum genus
• Maximum genus, girth and connectivity
• Graphs of given genus and arbitrarily large maximum genus
• Bounds for the average genus of the vertex-amalgamation of graphs
• A tight lower bound on the maximum genus of a simplicial graph
• Genus polynomials of ladder-like sequences of graphs
• The geodesic-transversal problem
• Nonorientable genera of Petersen powers
• On the average crosscap number. II: Bounds for a graph
• Up-embeddability of a graph by order and girth
• Structure for a graph with average genus
• The total embedding distributions of cacti and necklaces
• On 2-cell embeddings of graphs with minimum numbers of regions
• Hierarchy for imbedding-distribution invariants of a graph
• Sulla tracciabilita' di grafi finiti su superficie compatte
• A new characterization of the maximum genus of a graph
• A note on disjoint cycles
• Survey of results on the maximum genus of a graph
• The embeddings of a graph—A survey
• The maximum genus, matchings and the cycle space of a graph

This page was built for publication: A Kuratowski-type theorem for the maximum genus of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2546205)