Combinatorial structure on triangulations. I: The structure of four colorings
From MaRDI portal
Publication:1393878
DOI10.1016/0001-8708(73)90015-7zbMath0277.55005OpenAlexW2004914936MaRDI QIDQ1393878
Publication date: 1973
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0001-8708(73)90015-7
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)
Related Items
Combinatorial structures on triangulations. II: Local colorings ⋮ Chromatic numbers of quadrangulations on closed surfaces ⋮ Eigenvalues of the Laplacian on the Goldberg-Coxeter constructions for 3- and 4-valent graphs ⋮ The non-existence of colorings ⋮ Geometric coloring theory ⋮ Les 5-colorations d'un graphe planaire forment une classe de commutation unique ⋮ Signed diagonal flips and the four color theorem ⋮ The number of edge 3-colorings of a planar cubic graph as a permanent ⋮ Combinatorial structures on triangulations. III: Coloring with regular polyhedra ⋮ Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus
Cites Work