2 citations · 9 across the 16 of their papers we have counts for
1 paper · 1 filter
Ben Cameron, Chính T. Hoàng
A graph is k-vertex-critical if χ(G)=k but χ(G−v)<k for all v∈V(G). We construct a new infinite families of k-vertex-critical (P5,C5)-free graphs for all k≥6.…