Four-Coloring $P_6$-Free Graphs. I. Extending an Excellent Precoloring-Reference-Cited by-同舟云学术

Four-Coloring $P_6$-Free Graphs. I. Extending an Excellent Precoloring

Published:2024-02-27 Issue:1 Volume:53 Page:111-145
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Chudnovsky Maria¹^ORCID,Spirkl Sophie²,Zhong Mingxian³^ORCID

Affiliation:

1. Mathematics Department, Princeton University, Princeton, NJ 08544 USA.

2. Princeton University, Princeton, NJ 08544 USA. Current address: Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada.

3. Columbia University, New York, NY 10027 USA. Current address: Department of Computer Science, Lehman College and the Graduate Center, City University of New York, New York, NY 10468 USA.

Funder

National Science Foundation

US Army Research Office

European Research Council

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Reference6 articles.

1. Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices

2. The complexity of colouring problems on dense graphs

3. Deciding k-Colorability of P 5-Free Graphs in Polynomial Time

4. Improved complexity results on k-coloring Pt-free graphs

5. Closing complexity gaps for coloring problems on H-free graphs

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

1. Four-Coloring $\boldsymbol{P_6}$-Free Graphs. II. Finding an Excellent Precoloring;SIAM Journal on Computing;2024-02-28

2. On the Finiteness of k-Vertex-Critical $$2P_2$$-Free Graphs with Forbidden Induced Squids or Bulls;Lecture Notes in Computer Science;2024