Some results on \(k\)-critical \(P_5\)-free graphs
From MaRDI portal
Publication:6157421
DOI10.1016/j.dam.2023.03.008zbMath1512.05127arXiv2108.05492MaRDI QIDQ6157421
Qingqiong Cai, Jan Goedgebeur, Shenwei Huang
Publication date: 11 May 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.05492
Related Items (4)
A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs ⋮ Vertex-critical \((P_5, \mathrm{chair})\)-free graphs ⋮ Infinite families of \(k\)-vertex-critical \((P_5, C_5)\)-free graphs ⋮ Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs
- Complexity of coloring graphs without paths and cycles
- Ore's conjecture on color-critical graphs is almost true
- The strong perfect graph theorem
- Critical \((P_6, \mathrm{banner})\)-free graphs
- House of graphs 2.0: a database of interesting graphs and more
- Constructions of \(k\)-critical \(P_5\)-free graphs
- Obstructions for three-coloring graphs without induced paths on six vertices
- Vertex-critical \((P_5\), banner)-free graphs
- Certifying coloring algorithms for graphs without long induced paths
- Note on the colouring of graphs
- A Certifying Algorithm for 3-Colorability of P 5-Free Graphs
- Exhaustive generation of k‐critical ‐free graphs
- On $3$-Colorable $P_5$-Free Graphs
- A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Some Theorems on Abstract Graphs
- \(k\)-critical graphs in \(P_5\)-free graphs
- Coloring graphs with no induced five‐vertex path or gem
This page was built for publication: Some results on \(k\)-critical \(P_5\)-free graphs
