Some Colouring Problems and their Complexity
From MaRDI portal
Publication:3968953
DOI10.1016/S0304-0208(08)73557-6zbMath0503.05027OpenAlexW1476248438MaRDI QIDQ3968953
A. J. Mansfield, Dominic J. A. Welsh
Publication date: 1982
Published in: Graph Theory, Proceedings of the Conference on Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73557-6
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items (5)
On the computational complexity of the order polynomial ⋮ A bibliography on chromatic polynomials ⋮ Exponential lower bounds for the tree-like Hajós calculus ⋮ Grassmann homomorphism and Hajós-type theorems ⋮ Hajós and Ore constructions for digraphs
This page was built for publication: Some Colouring Problems and their Complexity
