Survey of results on the maximum genus of a graph

DOI10.1002/JGT.3190030102zbMATH Open0398.05029OpenAlexW2085320704MaRDI QIDQ4182771FDOQ4182771

Authors: 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)

Cites Work

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

Cited In (14)

• The maximum genus of graphs of diameter two
• A tight lower bound on the maximum genus of a 3-connected loopless multigraph
• A relative maximum genus graph embedding and its local maximum genus
• A note on upper embeddable graphs
• Graph ear decompositions and graph embeddings
• Geometric and algebraic structures associated with the channel quantization problem
• Title not available (Why is that?)
• A new characterization of the maximum genus of a graph
• An orientation theorem with parity conditions
• On locally quasiconnected graphs and their upper embeddability
• Embedding of metric graphs on hyperbolic surfaces
• A tight lower bound on the maximum genus of a simplicial graph
• On the number of maximum genus embeddings of almost all graphs
• Bowtie-free graphs have a Ramsey lift

This page was built for publication: Survey of results on 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 Q4182771)