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

DOI10.1080/0020739880190604MaRDI QIDQ3033786zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• Numerical calculations on the four-color problem
• Thirteen Colorful Variations on Guthrie's Four-Color Conjecture

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)