Coloring planar perfect graphs by decomposition

DOI10.1007/BF02579263MaRDI QIDQ1093649zbMATH OpenOpenAlexFDO

Authors B. George

Publication date 1986

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02579263

zbMATH Keywords

colouring algorithmdecomposition schemecolouring perfect graphsperfect planar graphs

Mathematics Subject Classification ID

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

Recommendations

• Complete colorings of planar graphs
• Coloring perfect degenerate graphs
• scientific article; zbMATH DE number 4049083
• An algorithm for colouring perfect planar graphs
• Colouring planar graphs
• Two-colourings that decompose perfect graphs
• scientific article; zbMATH DE number 1944138
• Coloring decompositions of complete geometric graphs
• On the total coloring of planar graphs.
• scientific article; zbMATH DE number 1347005

Cites work

• scientific article; zbMATH DE number 3394154 (Why is no real title available?)
• An O(N2) algorithm for coloring perfect planar graphs
• The Strong Perfect Graph Conjecture for Planar Graphs
• The ellipsoid method and its consequences in combinatorial optimization

Cited in

(8)

• On planar perfectly contractile graphs
• Decomposition of perfect graphs
• An O(N2) algorithm for coloring perfect planar graphs
• An algorithm for colouring perfect planar graphs
• scientific article; zbMATH DE number 4049083 (Why is no real title available?)
• Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
• scientific article; zbMATH DE number 1033812 (Why is no real title available?)
• Colouring perfect planar graphs in parallel

This page was built for publication: Coloring planar perfect graphs by decomposition

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