2018/12/27 by Meng Ji, Xueliang Li, Ji, Meng +1
Computer Science · Mathematics · #05C15 #05C35 #05C40 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1812.10701
openalex publication_date 2018/12/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A path in an edge-colored graph is called a conflict-free path if there exists a color used on only one of its edges. An edge-colored graph is called conflict-free connected if there is a conflict-free path between each pair of distinct vertices. The conflict-free connection number of a connected graph G, denoted by cfc(G), is defined as the smallest number of colors that are required to make G conflict-free connected. In this paper, we obtain Erdös-Gallai-type results for the conflict-free connection numbers of graphs.