Vertex-critical (P₃+ℓ P₁)-free and vertex-critical (gem, co-gem)-free graphs

2022/06/07 by Tala Abuadas, Ben Cameron, Abuadas, Tala +5
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.2206.03422

openalex publication_date 2022/06/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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

Related

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