Colouring planar graphs

DOI10.1007/978-3-540-37634-7_14MaRDI QIDQ3517217zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(12)

• On linear-time algorithms for five-coloring planar graphs
• Coloring planar perfect graphs by decomposition
• Colouring of generalized signed triangle-free planar graphs
• Reconfiguring 10-colourings of planar graphs
• Coloring plane graphs with independent crossings
• A Linear Algorithm for Colouring Planar Graphs with Five Colours
• scientific article; zbMATH DE number 4023314 (Why is no real title available?)
• scientific article; zbMATH DE number 6849640 (Why is no real title available?)
• scientific article; zbMATH DE number 7266772 (Why is no real title available?)
• WORM colorings of planar graphs
• Relational and Kleene-Algebraic Methods in Computer Science
• Grid drawings of \(k\)-colourable 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)