Author:
Hoàng Chính T.,Moore Brian,Recoskie Daniel,Sawada Joe
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference11 articles.
1. Three complexity results on coloring Pk-free graphs, 20th International Workshop on Combinatorial Algorithms;Broersma,2009
2. A certifying algorithm for 3-colorability of P5-free graphs;Bruce,2009
3. The strong perfect graph theorem;Chudnovsky;Annals of Mathematics,2006
4. Deciding k-colorability of P5-free graphs in polynomial time;Hoàng;Algorithmica,2010
5. A Note on k-Colorability of P5-Free Graphs;Hoàng;Lecture Notes In Computer Science,2008
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On color-critical (P5,co-P5)-free graphs;Discrete Applied Mathematics;2017-01
2. On k-critical -free graphs;Electronic Notes in Discrete Mathematics;2013-11