Vertex-Critical ( $$P_5$$ P 5 , banner)-Free Graphs-Reference-Cited by-同舟云学术

Vertex-Critical ( $$P_5$$ P 5 , banner)-Free Graphs

Published:2019 Issue: Volume: Page:111-120
ISSN:0302-9743
Container-title:Frontiers in Algorithmics
language:
Short-container-title:

Author:

Cai Qingqiong,Huang Shenwei,Li Tao,Shi Yongtang

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-18126-0_10

Reference22 articles.

1. Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, London (2008)

2. Lecture Notes in Computer Science;D Bruce,2009

3. Chudnovsky, M., Goedgebeur, J., Schaudt, O., Zhong, M.: Obstructions for three-coloring and list three-coloring H-free graphs. arXiv:1703.05684 [math.CO]

4. Chudnovsky, M., Goedgebeur, J., Schaudt, O., Zhong, M.: Obstructions for three-coloring graphs with one forbidden induced subgraph. In: Proceedings of the Twenty-seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1774–1783 (2016)

5. Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51–229 (2006)

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

1. Infinite Families of k-Vertex-Critical ($$P_5$$, $$C_5$$)-Free Graphs;Graphs and Combinatorics;2024-02-25

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

3. Critical $$(P_5,dart)$$-Free Graphs;Combinatorial Optimization and Applications;2023-12-09

4. Colouring Graphs with No Induced Six-Vertex Path or Diamond;Lecture Notes in Computer Science;2021

5. k-Critical Graphs in $$P_5$$-Free Graphs;Lecture Notes in Computer Science;2020