List Coloring in the Absence of a Linear Forest

This publication has 18 references indexed in Scilit:

• Colouring vertices of triangle-free graphs without forests
  Discrete Mathematics, 2012
• Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time
  Theoretical Computer Science, 2012
• 4-Coloring H-Free Graphs When H Is Small
  Lecture Notes in Computer Science, 2012
• Updating the complexity status of coloring graphs without a fixed induced linear forest
  Theoretical Computer Science, 2012
• A Certifying Algorithm for 3-Colorability of P 5-Free Graphs
  2009
• Three Complexity Results on Coloring P k -Free Graphs
  Lecture Notes in Computer Science, 2009
• Deciding k-Colorability of P 5-Free Graphs in Polynomial Time
  Algorithmica, 2008
• Graph Theory
  2008
• Dominating cliques in P5-free graphs
  Periodica Mathematica Hungarica, 1990
• The NP-Completeness of Edge-Coloring
  SIAM Journal on Computing, 1981