Vertex-critical graphs in co-gem-free graphs

2024/08/09 by Beaton, Iain, Cameron, Ben
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics

paper · doi:10.48550/arxiv.2408.05027

Abstract

A graph G is k-vertex-critical if χ(G)=k but χ(G-v)

Related

• Vertex-critical (P₃+ℓ P₁)-free and vertex-critical (gem, co-gem)-free graphs
• Critical (P₅,W₄)-Free Graphs
• Infinite families of k-vertex-critical (P₅, C₅)-free graphs
• Vertex-critical graphs far from edge-criticality
• Three-coloring triangle-free graphs without long forbidden paths