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

DOI10.1080/0020739880190604zbMATH Open0692.05033OpenAlexW1998773405MaRDI QIDQ3033786FDOQ3033786

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

Recommendations

• A Linear Algorithm for Colouring Planar Graphs with Five Colours
• scientific article; zbMATH DE number 4134072
• scientific article; zbMATH DE number 1743833
• Optimal Parallel 5-Colouring of Planar Graphs
• On linear-time algorithms for five-coloring planar graphs

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

• Title not available (Why is that?)
• Thirteen Colorful Variations on Guthrie's Four-Color Conjecture
• Numerical calculations on the four-color problem

This page was built for publication: An iV‐colour theorem for sequentially constructed planar graphs with myopic colouring

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