Papers › Some Results on k-Critical P₅-Free Graphs
Some Results on k-Critical P₅-Free Graphs
Qingqiong Cai, Jan Goedgebeur, Shenwei Huang
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A graph G is k-vertex-critical if G has chromatic number k but every proper induced subgraph of G has chromatic number less than k. The study of k-vertex-critical graphs for graph classes is an important topic in algorithmic graph theory because if the number of such graphs that are in a given hereditary graph class is finite, then there is a polynomial-time algorithm to decide if a graph in the class is (k-1)-colorable. In this paper, we prove that for every fixed integer k≥1, there are only finitely many k-vertex-critical (P₅,gem)-free graphs and (P₅,P₃+P₂)-free graphs. To prove the results we use a known structure theorem for (P₅,gem)-free graphs combined with properties of k-vertex-critical graphs. Moreover, we characterize all k-vertex-critical (P₅,gem)-free graphs and (P₅,P₃+P₂)-free graphs for k ∈{4,5} using a computer generation algorithm.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections