2018/12/31 by Sebastián González Hermosillo de la Maza, de la Maza, Sebastián González Hermosillo, Yifan Jing +3
Computer Science · Mathematics · #05C75 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1901.00043
openalex publication_date 2018/12/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this research, we determine the structure of (claw, bull)-free graphs. We show that every connected (claw, bull)-free graph is either an expansion of a path, an expansion of a cycle, or the complement of a triangle-free graph; where an expansion of a graph G is obtained by replacing its vertices with disjoint cliques and adding all edges between cliques corresponding to adjacent vertices of G. This result also reveals facts about the structure of triangle-free graphs, which might be of independent interest.