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)
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
Related Items (max. 100)
Unnamed Item ⋮ Mutation on knots and Whitney's 2-isomorphism theorem ⋮ Non-zero sum Heffter arrays and their applications ⋮ A simpler proof of the excluded minor theorem for higher surfaces ⋮ Uniqueness and minimality of large face-width embeddings of graphs ⋮ Some recent progress and applications in graph minor theory ⋮ Approximation Algorithms for Euler Genus and Related Problems ⋮ Weak Heffter arrays and biembedding graphs on non-orientable surfaces ⋮ Blocking nonorientability of a surface ⋮ Tight globally simple nonzero sum Heffter arrays and biembeddings ⋮ Approximation algorithms via contraction decomposition ⋮ Asymptotic enumeration and limit laws for graphs of fixed genus ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Spanners in sparse graphs ⋮ On the flexibility of toroidal embeddings ⋮ The chromatic polynomial of fatgraphs and its categorification ⋮ Parameterized complexity of the spanning tree congestion problem ⋮ Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs ⋮ Strong embeddings of minimum genus ⋮ Contraction obstructions for treewidth ⋮ On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces ⋮ Relative Heffter arrays and biembeddings ⋮ On essential and inessential polygons in embedded graphs
This page was built for publication: Combinatorial Local Planarity and the Width of Graph Embeddings
