Survey of results on the maximum genus of a graph
From MaRDI portal
Publication:4182771
DOI10.1002/jgt.3190030102zbMath0398.05029MaRDI QIDQ4182771
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
05C35: Extremal problems in graph theory
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Unnamed Item, EMBEDDING OF METRIC GRAPHS ON HYPERBOLIC SURFACES, An orientation theorem with parity conditions, Graph ear decompositions and graph embeddings, Geometric and algebraic structures associated with the channel quantization problem, On the number of maximum genus embeddings of almost all 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, A tight lower bound on the maximum genus of a simplicial graph, The maximum genus of graphs of diameter two, Bowtie-free graphs have a Ramsey lift, A note on upper embeddable graphs, On locally quasiconnected graphs and their upper embeddability, A new characterization of the maximum genus of a graph
Cites Work
