List coloring in the absence of two subgraphs

DOI10.1007/978-3-642-38233-8_24MaRDI QIDQ4924657zbMATH OpenOpenAlexFDO

Authors Petr A. Golovach, Daniël Paulusma

Publication date 7 June 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://dro.dur.ac.uk/14178/1/14178.pdf

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• List coloring in the absence of two subgraphs
• Closing complexity gaps for coloring problems on \(H\)-free graphs
• Closing complexity gaps for coloring problems on \(H\)-free graphs
• Complexity dichotomy for list-5-coloring with a forbidden induced subgraph
• Colouring \((P_r + P_s)\)-free graphs

Cited in

(4)

• List coloring in the absence of two subgraphs
• Colouring of graphs with Ramsey-type forbidden subgraphs
• The coloring problem for classes with two small obstructions
• Two cases of polynomial-time solvability for the coloring problem

This page was built for publication: List coloring in the absence of two subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924657)