Chromatic reduction of the triangulations \(T_e, e=e_5+e_7\)

DOI10.1016/0095-8956(72)90007-XzbMath0242.05110OpenAlexW2041175950MaRDI QIDQ2553973

H. Heesch

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(72)90007-x

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (7)

Inégalités nouvelles dans le problème des quatre couleurs ⋮ The four-color theorem for small maps ⋮ Triangulation à \(V_5\) séparée dans le problème des quatre couleurs ⋮ Fast reversible coding and indexing of colorations ⋮ An unavoidable set of configurations in planar trigangulations ⋮ An existence theorem for planar maps ⋮ The four color proof suffices

This page was built for publication: Chromatic reduction of the triangulations \(T_e, e=e_5+e_7\)