1 paper
Melvin Adekanye, Christopher Bury, Ben Cameron +1
A graph is k-vertex-critical if χ(G)=k but χ(G−v)<k for all v∈V(G) and (G,H)-free if it contains no induced subgraph isomorphic to G or H. We show that there are o…