Coloring graphs characterized by a forbidden subgraph
暂无分享,去创建一个
[1] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..
[2] Jian Song,et al. 4-coloring H-free graphs when H is small , 2012, Discret. Appl. Math..
[3] L. Lovász,et al. Polynomial Algorithms for Perfect Graphs , 1984 .
[4] Ingo Schiermeyer,et al. Vertex Colouring and Forbidden Subgraphs – A Survey , 2004, Graphs Comb..
[5] Vadim V. Lozin,et al. Vertex 3-colorability of Claw-free Graphs , 2007, Algorithmic Oper. Res..
[6] David S. Johnson,et al. Some simplified NP-complete problems , 1974, STOC '74.
[7] Daniel Lokshtanov,et al. Independent Set in P5-Free Graphs in Polynomial Time , 2014, SODA.
[8] Stefan Arnborg,et al. Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..
[9] Zsolt Tuza,et al. Graph colorings with local constraints - a survey , 1997, Discuss. Math. Graph Theory.
[10] Zsolt Tuza,et al. Complexity of Coloring Graphs without Forbidden Induced Subgraphs , 2001, WG.
[11] Miroslav Chlebík,et al. Hard coloring problems in low degree planar bipartite graphs , 2006, Discret. Appl. Math..
[12] Jian Song,et al. Updating the complexity status of coloring graphs without a fixed induced linear forest , 2012, Theor. Comput. Sci..
[13] Vadim V. Lozin,et al. Coloring edges and vertices of graphs without short or long cycles , 2007, Contributions Discret. Math..
[14] Myriam Preissmann,et al. On the NP-completeness of the k-colorability problem for triangle-free graphs , 1996, Discret. Math..
[15] Robin Thomas,et al. Quickly excluding a forest , 1991, J. Comb. Theory, Ser. B.