Coloring Graphs without Short Cycles and Long Induced Paths-Reference-Cited by-同舟云学术

Coloring Graphs without Short Cycles and Long Induced Paths

Published:2011 Issue: Volume: Page:193-204
ISSN:0302-9743
Container-title:Fundamentals of Computation Theory
language:
Short-container-title:

Author:

Golovach Petr A.,Paulusma Daniël,Song Jian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22953-4_17

Reference22 articles.

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

2. Brandt, S.: Triangle-free graphs and forbidden subgraphs. Discrete Applied Mathematics 120, 25–33 (2002)

3. Brinkmann, G., Meringer, M.: The Smallest 4-Regular 4-Chromatic Graphs with Girth 5. Graph Theory Notes of New York 32, 40–41 (1997)

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

5. Broersma, H.J., Golovach, P.A., Paulusma, D., Song, J.: Updating the complexity status of coloring graphs without a fixed induced linear forest, manuscript, http://www.dur.ac.uk/daniel.paulusma/Papers/Submitted/updating.pdf

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

1. The coloring problem for classes with two small obstructions;Optimization Letters;2014-03-02

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

3. 4-coloring H-free graphs when H is small;Discrete Applied Mathematics;2013-01

4. Improved Complexity Results on k-Coloring P t -Free Graphs;Mathematical Foundations of Computer Science 2013;2013

5. List Coloring in the Absence of Two Subgraphs;Lecture Notes in Computer Science;2013