Combinatorial Local Planarity and the Width of Graph Embeddings
From MaRDI portal
Publication:4027844
DOI10.4153/CJM-1992-076-8zbMath0777.05052MaRDI QIDQ4027844
Publication date: 9 March 1993
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
05C10: Planar graphs; geometric and topological aspects of graph theory
57M15: Relations of low-dimensional topology with graph theory
Related Items
Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs, Strong embeddings of minimum genus, Some recent progress and applications in graph minor theory, A simpler proof of the excluded minor theorem for higher surfaces, Blocking nonorientability of a surface, On essential and inessential polygons in embedded graphs, Uniqueness and minimality of large face-width embeddings of graphs, Contraction obstructions for treewidth, Asymptotic enumeration and limit laws for graphs of fixed genus, On the flexibility of toroidal embeddings, The chromatic polynomial of fatgraphs and its categorification, Unnamed Item