List Coloring in the Absence of a Linear Forest-Reference-Cited by-同舟云学术

List Coloring in the Absence of a Linear Forest

Published:2011 Issue: Volume: Page:119-130
ISSN:0302-9743
Container-title:Graph-Theoretic Concepts in Computer Science
language:
Short-container-title:

Author:

Couturier Jean-François,Golovach Petr A.,Kratsch Dieter,Paulusma Daniël

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-25870-1_12

Reference27 articles.

1. Bacsó, G., Tuza, Z.: Dominating cliques in P 5-free graphs. Periodica Mathematica Hungarica 21, 303–308 (1990)

2. Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer Graduate Texts in Mathematics, vol. 244 (2008)

3. Lecture Notes in Computer Science;H. Broersma,2009

4. Broersma, H.J., Golovach, P.A., Paulusma, D., Song, J.: Updating the complexity status of coloring graphs without a fixed induced linear forest (manuscript)

5. Broersma, H.J., Golovach, P.A., Paulusma, D., Song, J.: Determining the chromatic number of triangle-free 2P 3-free graphs in polynomial time (manuscript)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Closing complexity gaps for coloring problems on H-free graphs;Information and Computation;2014-10

2. Coloring graphs without short cycles and long induced paths;Discrete Applied Mathematics;2014-04

3. List coloring in the absence of two subgraphs;Discrete Applied Mathematics;2014-03

4. Colouring of graphs with Ramsey-type forbidden subgraphs;Theoretical Computer Science;2014-02

5. Colouring of Graphs with Ramsey-Type Forbidden Subgraphs;Graph-Theoretic Concepts in Computer Science;2013