Author:
Malyshev D. S.,Pristavchenko O. V.
Publisher
Springer Science and Business Media LLC
Reference15 articles.
1. Bonomo, F., Chudnovsky, M., Maceli, P., Schaudt, O., Stein, M., Zhong, M.: Three-coloring and list three-coloring of graphs without induced paths on seven vertices. Combinatorica 38, 779–801 (2018)
2. Broersma, H.J., Golovach, P.A., Paulusma, D., Song, J.: Updating the complexity status of coloring graphs without a fixed induced linear forest. Theoret. Comput. Sci. 414, 9–19 (2012)
3. Dailey, D.P.: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Discret. Math. 30, 289–293 (1980)
4. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Co., New York (1979)
5. Golovach, P.A., Paulusma, D., Song, J.: 4-coloring $$H$$-free graphs when $$H$$ is small. Discret. Appl. Math. 161, 140–150 (2013)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献