Author:
Razvenskaya O. O.,Malyshev D. S.
Subject
Applied Mathematics,Industrial and Manufacturing Engineering
Reference17 articles.
1. M. R. Garey and D. S. Johnson, Computers and
Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco,
1979; Mir, Moscow, 1982).
2. D. Král’, J. Kratochvíl, Z. Tuza, and G. Woeginger,
“Complexity of Coloring Graphs without Forbidden Induced Subgraphs,” in Graph-Theoretic Concepts in Computer Science: Proceedings of 27th International Workshop (Boltenhagen, Germany, June 14–16,
2001) (Springer, Heidelberg, 2001), pp. 254–262 [Lecture
Notes in Computer Science, Vol. 2204].
3. V. V. Lozin and D. S. Malyshev, “Vertex Coloring of Graphs with Few
Obstructions,” Discrete Appl. Math. 216, 273–280
(2017).
4. P. A. Golovach, M. Johnson, D. Paulusma, and J. Song, “A Survey on the
Computational Complexity of Coloring Graphs with Forbidden Subgraphs,” J. Graph Theory.
84, 331–363 (2017).
5. K. Cameron, S. Huang, I. Penev, and V. Sivaraman, “The Class of
$$(P_7,C_4,C_5)
$$-Free Graphs: Decomposition, Algorithms, and
$$\chi
$$-Boundedness,” J. Graph Theory 93 (4), 503–552 (2019).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献