Journal of Combinatorial Theory Series B
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Algorithmic complexity of list colorings
Discrete Applied Mathematics
On the NP-completeness of the k-colorability problem for triangle-free graphs
Discrete Mathematics
Generalized coloring for tree-like graphs
Discrete Applied Mathematics
Edge dominating set and colorings on graphs with fixed clique-width
Discrete Applied Mathematics
Complexity of Coloring Graphs without Forbidden Induced Subgraphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Vertex Colouring and Forbidden Subgraphs – A Survey
Graphs and Combinatorics
Clique-Width for 4-Vertex Forbidden Subgraphs
Theory of Computing Systems
Choosability of P5-Free Graphs
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
On the structure of (P5,gem)-free graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Note: A decidability result for the dominating set problem
Theoretical Computer Science
Coloring graphs without short cycles and long induced paths
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Updating the complexity status of coloring graphs without a fixed induced linear forest
Theoretical Computer Science
Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time
Theoretical Computer Science
List coloring in the absence of a linear forest
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
A Characterization of b-Perfect Graphs
Journal of Graph Theory
Coloring graphs characterized by a forbidden subgraph
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
4-coloring H-free graphs when H is small
Discrete Applied Mathematics
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.04 |
A list assignment of a graph G=(V,E) is a function L that assigns a list L(u) of so-called admissible colors to each u@?V. The List Coloring problem is that of testing whether a given graph G=(V,E) has a coloring c that respects a given list assignment L, i.e., whether G has a mapping c:V-{1,2,...} such that (i) c(u)c(v) whenever uv@?E and (ii) c(u)@?L(u) for all u@?V. If a graph G has no induced subgraph isomorphic to some graph of a pair {H"1,H"2}, then G is called (H"1,H"2)-free. We completely characterize the complexity of List Coloring for (H"1,H"2)-free graphs.