Colouring perfect planar graphs in parallel

DOI10.1007/3-540-50728-0_50MaRDI QIDQ6118598

Iain A. Stewart

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Coloring planar perfect graphs by decomposition
• A fast parallel coloring of planar graphs with five colors
• Every planar map is four colorable. I: Discharging
• An O(N2) algorithm for coloring perfect planar graphs
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• Coloring planar graphs in parallel
• The Strong Perfect Graph Conjecture for Planar Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Colouring perfect planar graphs in parallel