Erdos-Gallai-type results for conflict-free connection of graphs

被引：0
|
作者：
Ji, Meng [1 ]
Li, Xueliang [1 ,2 ]
机构：
[1] Nankai Univ, Ctr Combinator & LPMC, Tianjin 300071, Peoples R China
[2] Qinghai Normal Univ, Sch Math & Stat, Xining 810008, Qinghai, Peoples R China
来源：
ARS COMBINATORIA | 2020年 / 152卷
关键词：
conflict-free connection coloring; conflict-free connection number; Erdos-Gallai-type result;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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 Erdos-Gallai-type results for the conflict-free connection numbers of graphs.
引用
收藏
页码：45 / 50
页数：6
相关论文
共 50 条
  • [1] ERDOS-GALLAI-TYPE RESULTS FOR TOTAL MONOCHROMATIC CONNECTION OF GRAPHS
    Jiang, Hui
    Li, Xueliang
    Zhang, Yingying
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2019, 39 (04) : 775 - 785
  • [2] Monochromatic disconnection: Erdos-Gallai-type problems and product graphs
    Li, Ping
    Li, Xueliang
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (01) : 136 - 153
  • [3] On conflict-free connection of graphs
    Chang, Hong
    Huang, Zhong
    Li, Xueliang
    Mao, Yaping
    Zhao, Haixing
    DISCRETE APPLIED MATHEMATICS, 2019, 255 : 167 - 182
  • [4] Strong conflict-free connection of graphs
    Ji, Meng
    Li, Xueliang
    APPLIED MATHEMATICS AND COMPUTATION, 2020, 364
  • [5] Some results on strong conflict-free connection number of graphs
    Ji, Meng
    Wang, Jing
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2021, 13 (05)
  • [6] A survey on conflict-free connection coloring of graphs☆
    Chang, Hong
    Huang, Zhong
    DISCRETE APPLIED MATHEMATICS, 2024, 352 : 88 - 104
  • [7] Conflict-Free Connection Number and Size of Graphs
    Trung Duy Doan
    Ingo Schiermeyer
    Graphs and Combinatorics, 2021, 37 : 1859 - 1871
  • [8] Graphs with Conflict-Free Connection Number Two
    Hong Chang
    Trung Duy Doan
    Zhong Huang
    Stanislav Jendrol’
    Xueliang Li
    Ingo Schiermeyer
    Graphs and Combinatorics, 2018, 34 : 1553 - 1563
  • [9] Conflict-Free Connection Numbers of Line Graphs
    Deng, Bo
    Li, Wenjing
    Li, Xueliang
    Mao, Yaping
    Zhao, Haixing
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2017, PT I, 2017, 10627 : 141 - 151
  • [10] Conflict-free connection number of random graphs
    Gu, Ran
    Li, Xueliang
    DISCRETE APPLIED MATHEMATICS, 2020, 283 : 522 - 532
12345