Chromatic reduction of the triangulations T_e, e=e₅+e₇

DOI10.1016/0095-8956(72)90007-XzbMATH Open0242.05110OpenAlexW2041175950MaRDI QIDQ2553973FDOQ2553973

Authors: 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)

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2553973)