The complexity of some graph colouring problems

DOI10.1016/0166-218X(92)90227-2zbMath0758.05050MaRDI QIDQ1192946

Keith J. Edwards

Publication date: 27 September 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

surfacegraph colouringlinear time algorithmcomputing complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Critically paintable, choosable or colorable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of some graph colouring problems