The complexity of \(G\)-free colourability
From MaRDI portal
Publication:1356726
DOI10.1016/S0012-365X(97)84217-3zbMath0904.05030MaRDI QIDQ1356726
Publication date: 5 November 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C15: Coloring of graphs and hypergraphs
Related Items
On 2-Subcolourings of Chordal Graphs, Unnamed Item, Partitions of graphs into cographs, The existence of uniquely \(-G\) colourable graphs, Subcolorings and the subchromatic number of a graph
Cites Work