Invalid counterexample in graph theory

DOI10.5539/JMR.V2N4P130MaRDI QIDQ3070564zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 3 February 2011

Published in Journal of Mathematics Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL http://www.ccsenet.org/journal/index.php/jmr/article/view/8020

zbMATH Keywords

color chainconfigurationcounterexamplereducibletopological graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• THE EXAMPLE THAT HEAWOOD SHOULD HAVE GIVEN
• scientific article; zbMATH DE number 2076921
• Decomposition and 4-colouring of a pair of dual trees of the Heawood graph
• A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles
• scientific article; zbMATH DE number 3974976

Cited in

(1)

• THE EXAMPLE THAT HEAWOOD SHOULD HAVE GIVEN

This page was built for publication: Invalid counterexample in graph theory

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