A graph is k-vertex-critical if χ(G)=k but χ(G-v)<k for all v∈
V(G). We ...
We give a new, stronger proof that there are only finitely many
k-vertex...
A graph G is k-vertex-critical if χ(G)=k but χ(G-v)<k for all
v∈ V(G) wh...
For k ≥ 3, we prove (i) there is a finite number of k-vertex-critical
(P...
A hole is an induced cycle with at least four vertices. A hole is even i...