An iV‐colour theorem for sequentially constructed planar graphs with myopic colouring

DOI10.1080/0020739880190604zbMath0692.05033OpenAlexW1998773405MaRDI QIDQ3033786

Sydney C. K. Chu

Publication date: 1988

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020739880190604

zbMATH Keywords

planar graphssequential colouring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Numerical calculations on the four-color problem
• Thirteen Colorful Variations on Guthrie's Four-Color Conjecture
• Unnamed Item