Choosability on H-free graphs

Authors:
Petr A. Golovach;Pinar Heggernes;Pim Van T Hof;DaniëL Paulusma
Affiliations:
Department of Informatics, University of Bergen, Norway;Department of Informatics, University of Bergen, Norway;Department of Informatics, University of Bergen, Norway;School of Engineering and Computing Sciences, Durham University, UK
Venue:
Information Processing Letters
Year:
2013

Citing 15
Cited 0

Some upper bounds on the total and list chromatic numbers of multigraphs

Journal of Graph Theory
Restricted colorings of graphs

Surveys in combinatorics, 1993
Every planar graph is 5-choosable

Journal of Combinatorial Theory Series B
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Choice number of 3-colorable elementary graphs

Proceedings of an international symposium on Graphs and combinatorics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Complexity of Coloring Graphs without Forbidden Induced Subgraphs

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Graphs whose choice number is equal to their chromatic number

Journal of Graph Theory
Choosability of P5-Free Graphs

MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Deciding k-Colorability of P 5-Free Graphs in Polynomial Time

Algorithmica - Including a Special Section on Genetic and Evolutionary Computation; Guest Editors: Benjamin Doerr, Frank Neumann and Ingo Wegener
On the complexity of some colorful problems parameterized by treewidth

Information and Computation
Updating the complexity status of coloring graphs without a fixed induced linear forest

Theoretical Computer Science
On the parameterized complexity of coloring graphs in the absence of a linear forest

Journal of Discrete Algorithms
Linear time algorithm for computing a small biclique in graphs without long induced paths

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Three complexity results on coloring Pk-free graphs

European Journal of Combinatorics

Quantified Score

Hi-index	0.89

Visualization

Abstract

A graph is H-free if it has no induced subgraph isomorphic to H. We determine the computational complexity of the Choosability problem restricted to H-free graphs for every graph H that does not belong to {K"1","3,P"1+P"2,P"1+P"3,P"4}. We also show that if H is a linear forest, then the problem is fixed-parameter tractable when parameterized by k.