Coloring algorithms for \(K_ 5\)-minor free graphs

DOI10.1016/0020-0190(90)90161-PzbMath0695.68039OpenAlexW1997094811MaRDI QIDQ910220

Samir Khuller

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90161-p

zbMATH Keywords

parallel algorithmsgraph minorsplanar graph coloring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Bemerkungen zu Hadwigers Vermutung
• Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
• NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
• Every planar map is four colorable. I: Discharging
• Über eine Eigenschaft der ebenen Komplexe
• Efficient Planarity Testing
• Dividing a Graph into Triconnected Components
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coloring algorithms for \(K_ 5\)-minor free graphs