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 条
  • [41] RAINBOW TOTAL-COLORING OF COMPLEMENTARY GRAPHS AND ERDOS-GALLAI TYPE PROBLEM FOR THE RAINBOW TOTAL-CONNECTION NUMBER
    Sun, Yuefang
    Jin, Zemin
    Tu, Jianhua
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (04) : 1023 - 1036
  • [42] Conflict-free Connection Number and Independence Number of a Graph
    Jing Wang
    Meng Ji
    Acta Mathematicae Applicatae Sinica, English Series, 2021, 37 : 278 - 286
  • [43] Conflict-free Connection Number and Independence Number of a Graph
    Jing WANG
    Meng JI
    Acta Mathematicae Applicatae Sinica, 2021, 37 (02) : 278 - 286
  • [44] Conflict-free Connection Number and Independence Number of a Graph
    Wang, Jing
    Ji, Meng
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2021, 37 (02): : 278 - 286
  • [45] Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
    Bhyravarapu, Sriram
    Hartmann, Tim A.
    Kalyanasundaram, Subrahmanyam
    Reddy, I. Vinod
    COMBINATORIAL ALGORITHMS, IWOCA 2021, 2021, 12757 : 92 - 106
  • [46] Conflict-Free Coloring of Intersection Graphs of Geometric Objects
    Keller, Chaya
    Smorodinsky, Shakhar
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 2397 - 2411
  • [47] Conflict-Free Coloring of Intersection Graphs of Geometric Objects
    Chaya Keller
    Shakhar Smorodinsky
    Discrete & Computational Geometry, 2020, 64 : 916 - 941
  • [48] Conflict-Free Coloring of Intersection Graphs of Geometric Objects
    Keller, Chaya
    Smorodinsky, Shakhar
    DISCRETE & COMPUTATIONAL GEOMETRY, 2020, 64 (03) : 916 - 941
  • [49] Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs
    Bhyravarapu, Sriram
    Hartmann, Tim A.
    Hoang, Hung P.
    Kalyanasundaram, Subrahmanyam
    Reddy, I. Vinod
    ALGORITHMICA, 2024, 86 (07) : 2250 - 2288
  • [50] PROPER CONFLICT-FREE COLORING OF GRAPHS WITH LARGE MAXIMUM DEGREE
    Cranston, Daniel W.
    Liu, Chun-Hung
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2024, 38 (04) : 3004 - 3027
12345