4-Coloring H-Free Graphs When H Is Small-Reference-Cited by-同舟云学术

4-Coloring H-Free Graphs When H Is Small

Published:2012 Issue: Volume: Page:289-300
ISSN:0302-9743
Container-title:SOFSEM 2012: Theory and Practice of Computer Science
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-27660-6_24

Reference25 articles.

1. Balas, E., Yu, C.S.: On graphs with polynomially solvable maximum-weight clique problem. Networks 19, 247–253 (1989)

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

3. Lecture Notes in Computer Science;H.J. 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), http://www.dur.ac.uk/daniel.paulusma/Papers/Submitted/updating.pdf

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), http://www.dur.ac.uk/daniel.paulusma/Papers/Submitted/2p3.pdf

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

1. List Coloring in the Absence of a Linear Forest;Algorithmica;2013-04-06

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

3. Closing Complexity Gaps for Coloring Problems on H-Free Graphs;Algorithms and Computation;2012

4. Coloring Graphs Characterized by a Forbidden Subgraph;Mathematical Foundations of Computer Science 2012;2012