Vertex-Critical (P5, chair)-Free Graphs

被引：0

作者：

Huang, Shenwei ^{[1
]}

Li, Zeyu ^{[2
]}

机构：

[1] College of Computer Science, Nankai University, Tianjin,300350, China

[2] Tianjin Key Laboratory of Network and Data Security Technology, Nankai University, Tianjin,300071, China

来源：

arXiv | 2023年

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Graph theory

引用

共 7 条

[1] Critical (P5, dart) -Free Graphs
Xia, Wen
Jooken, Jorik
Goedgebeur, Jan
Huang, Shenwei
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2024, 14462 LNCS : 390 - 402
[2] Coloring (P5,gem-free graphs with Δ−1 colors
Cranston, Daniel W.
Lafayette, Hudson
Rabern, Landon
Journal of Graph Theory, 2022, 101 (04): : 633 - 642
[3] Preparing Fermilab to Carry Out the P5 Plan
Bellettini, Giorgio
arXiv,
[4] Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time
Agrawal, Akanksha
Lima, Paloma T.
Lokshtanov, Daniel
Saurabh, Saket
Sharma, Roohani
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2024, 2024-January : 5276 - 5290
[5] The total coloring of K5-minor-free graphs
Yang, Fan
Wu, Jianliang
arXiv, 2021,
[6] The Borodin-Kostochka Conjecture for Some {P2 ∪P3}-Free Graphs
Wang, Hongyang
SSRN, 2023,
[7] Structure and coloring of some (P7, C4)-free graphs
Institute of Mathematics, School of Mathematical Sciences, Nanjing Normal University, 1 Wenyuan Road, Nanjing
210023, China
arXiv,