scientific article; zbMATH DE number 4049083

MaRDI QIDQ3785973zbMATH OpenFDO

Authors Iain Stewart

Publication date 1987

zbMATH Keywords

colouringLipton-Tarjan separator algorithmperfect, planar graphtime complexity

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Coloring of graphs and hypergraphs (05C15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An algorithm for colouring perfect planar graphs
• An O(N2) algorithm for coloring perfect planar graphs
• Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
• Coloring planar perfect graphs by decomposition
• A Linear Algorithm for Colouring Planar Graphs with Five Colours

Cited in

(8)

• Coloring planar perfect graphs by decomposition
• An algorithm for colouring perfect planar graphs
• A Linear Algorithm for Colouring Planar Graphs with Five Colours
• An O(N2) algorithm for coloring perfect planar graphs
• Improved edge-coloring algorithms for planar graphs
• Colouring perfect planar graphs in parallel
• Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
• A simple algorithm for 4-coloring 3-colorable planar graphs

This page was built for publication:

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