Abstract
A graph is -vertex-critical if but for all where denotes the chromatic number of . We show that there are only finitely many -critical -free graphs for all and all . Together with previous results, the only graphs for which it is unknown if there are an infinite number of -vertex-critical -free graphs is for all . We consider a restriction on the smallest open case, and show that there are only finitely many -vertex-critical (gem, co-gem)-free graphs for all , where gem. To do this, we show the stronger result that every vertex-critical (gem, co-gem)-free graph is either complete or a clique expansion of . This characterization allows us to give the complete list of all -vertex-critical (gem, co-gem)-free graphs for all
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.