Colouring planar graphs

DOI10.1007/978-3-540-37634-7_14zbMATH Open1159.05020OpenAlexW74480261MaRDI QIDQ3517217FDOQ3517217

Authors: Paulette Lieby 

Publication date: 12 August 2008

Published in: Discovering Mathematics with Magma (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-37634-7_14

Recommendations

• scientific article; zbMATH DE number 1256776
• A simple algorithm for 4-coloring 3-colorable planar graphs
• A Linear Algorithm for Colouring Planar Graphs with Five Colours
• On linear-time algorithms for five-coloring planar graphs
• scientific article; zbMATH DE number 4023314

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Cited In (12)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Colouring of generalized signed triangle-free planar graphs
• A Linear Algorithm for Colouring Planar Graphs with Five Colours
• Relational and Kleene-Algebraic Methods in Computer Science
• Reconfiguring 10-colourings of planar graphs
• Coloring planar perfect graphs by decomposition
• Grid drawings of \(k\)-colourable graphs
• Coloring plane graphs with independent crossings
• WORM colorings of planar graphs
• On linear-time algorithms for five-coloring planar graphs

This page was built for publication: Colouring planar graphs

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