scientific article; zbMATH DE number 4047151

MaRDI QIDQ3783597zbMATH OpenFDO

Authors Torben Hagerup, Krzysztof Diks, Marek Chrobak

Publication date 1987

zbMATH Keywords

parallel RAM5-colouring of planar graphstriangular planar subdivisions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Optimal Parallel 5-Colouring of Planar Graphs
• scientific article; zbMATH DE number 3968611
• Coloring planar graphs in parallel
• Fast algorithms for edge-coloring planar graphs
• Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs

Cited in

(8)

• Optimal Parallel 5-Colouring of Planar Graphs
• Parallel construction of subdivision hierarchies
• scientific article; zbMATH DE number 3968611 (Why is no real title available?)
• Coloring algorithms for \(K_ 5\)-minor free graphs
• Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
• Parallel algorithms for fractional and maximal independent sets in planar graphs
• Oriented 5-coloring of sparse plane graphs
• Colouring perfect planar graphs in parallel

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 Q3783597)