Survey of results on the maximum genus of a graph

DOI10.1002/jgt.3190030102zbMath0398.05029OpenAlexW2085320704MaRDI QIDQ4182771

Richard D. Ringeisen

Publication date: 1979

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190030102

zbMATH Keywords

Maximum Genus of a Graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (14)

A tight lower bound on the maximum genus of a simplicial graph ⋮ Bowtie-free graphs have a Ramsey lift ⋮ Graph ear decompositions and graph embeddings ⋮ EMBEDDING OF METRIC GRAPHS ON HYPERBOLIC SURFACES ⋮ On the number of maximum genus embeddings of almost all graphs ⋮ Unnamed Item ⋮ A note on upper embeddable graphs ⋮ A new characterization of the maximum genus of a graph ⋮ The maximum genus of graphs of diameter two ⋮ An orientation theorem with parity conditions ⋮ Geometric and algebraic structures associated with the channel quantization problem ⋮ On locally quasiconnected graphs and their upper embeddability ⋮ 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

Cites Work

• Upper embeddability and connectivity of graphs
• On the maximum genus of a graph
• A Kuratowski-type theorem for the maximum genus of a graph
• The Maximum Genus of Cartesian Products of Graphs
• The Genus, Regional Number, and Betti Number of a Graph

This page was built for publication: Survey of results on the maximum genus of a graph