On the maximum genus of a graph

DOI10.1016/0095-8956(71)90036-0zbMath0217.02204OpenAlexW1964406530MaRDI QIDQ2546204

E. A. Nordhaus, B. M. Stewart, Arthur T. White

Publication date: 1971

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(71)90036-0

Mathematics Subject Classification ID

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

Related Items (44)

Up-embeddability of graphs with small order ⋮ Topological Graph Theory: A Personal Account ⋮ Maximum genus and maximum nonseparating independent set of a 3-regular graph ⋮ A tight lower bound on the maximum genus of a simplicial graph ⋮ Face distributions of embeddings of complete graphs ⋮ Genus distributions for iterated claws ⋮ A note on disjoint cycles ⋮ Graph ear decompositions and graph embeddings ⋮ Maximum genus and chromatic number of graphs ⋮ Up-embeddability of a graph by order and girth ⋮ Up-embeddability of graphs with new degree-sum ⋮ On the lower bounds for the maximum genus for simple graphs ⋮ A note on upper embeddable graphs ⋮ A new characterization of the maximum genus of a graph ⋮ A class of upper-embeddable graphs ⋮ Unnamed Item ⋮ The maximum genus of graphs of diameter two ⋮ A sufficient condition on upper embeddability of graphs ⋮ An orientation theorem with parity conditions ⋮ On the maximum genus of some graphs with upper imbeddable subgraphs ⋮ An additivity theorem for maximum genus of a graph ⋮ The combinatorial map color theorem ⋮ How to determine the maximum genus of a graph ⋮ Upper-embeddable graphs and related topics ⋮ Upper embeddability and connectivity of graphs ⋮ Sulla tracciabilita' di grafi finiti su superficie compatte ⋮ Survey of results on the maximum genus of a graph ⋮ A note on conservative graphs ⋮ Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings ⋮ Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings ⋮ A Nebeský-type characterization for relative maximum genus ⋮ A Kuratowski-type theorem for the maximum genus of a graph ⋮ Up-embeddability via girth and the degree-sum of adjacent vertices ⋮ Upper embeddability, girth and the degree-sum of nonadjacent vertices ⋮ Upper embeddability, edge independence number and girth ⋮ The maximum genus of graphs with diameter three ⋮ Maximum genus and girth of graphs ⋮ Graphs of given genus and arbitrarily large maximum genus ⋮ Extensions on 2-edge connected 3-regular up-embeddable graphs ⋮ A note on the maximum genus of 3-edge-connected nonsimple graphs ⋮ Face size and the maximum genus of a graph. I: Simple graphs ⋮ A relative maximum genus graph embedding and its local maximum genus ⋮ A tight lower bound on the maximum genus of a 3-connected loopless multigraph ⋮ The maximum genus, matchings and the cycle space of a graph

Cites Work

• Unnamed Item
• Irreducible graphs
• On the surface duality of linear graphs
• The Genus, Regional Number, and Betti Number of a Graph
• Additivity of the genus of a graph
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

This page was built for publication: On the maximum genus of a graph