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 条
  • [31] Conflict-Free Coloring of String Graphs
    Chaya Keller
    Alexandre Rok
    Shakhar Smorodinsky
    Discrete & Computational Geometry, 2021, 65 : 1337 - 1372
  • [32] Conflict-Free Colourings of Graphs and Hypergraphs
    Pach, Janos
    Tardos, Gabor
    COMBINATORICS PROBABILITY & COMPUTING, 2009, 18 (05): : 819 - 834
  • [33] Conflict-Free Coloring of String Graphs
    Keller, Chaya
    Rok, Alexandre
    Smorodinsky, Shakhar
    DISCRETE & COMPUTATIONAL GEOMETRY, 2021, 65 (04) : 1337 - 1372
  • [34] CONFLICT-FREE VERTEX-CONNECTIONS OF GRAPHS
    Li, Xueliang
    Zhang, Yingying
    Zhu, Xiaoyu
    Mao, Yaping
    Zhao, Haixing
    Jendrol, Stanislav
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2020, 40 (01) : 51 - 65
  • [35] Remarks on proper conflict-free colorings of graphs
    Caro, Yair
    Petrusevski, Mirko
    Skrekovski, Riste
    DISCRETE MATHEMATICS, 2023, 346 (02)
  • [36] Proper conflict-free coloring of sparse graphs
    Cho, Eun-Kyung
    Choi, Ilkyoo
    Kwon, Hyemin
    Park, Boram
    DISCRETE APPLIED MATHEMATICS, 2025, 362 : 34 - 42
  • [37] Complexity results for two kinds of conflict-free edge-coloring of graphs
    Li, Ping
    DISCRETE APPLIED MATHEMATICS, 2025, 367 : 218 - 225
  • [38] Parameterized algorithms for conflict-free colorings of graphs
    Reddy, I. Vinod
    THEORETICAL COMPUTER SCIENCE, 2018, 745 : 53 - 62
  • [39] Conflict-free coloring on subclasses of perfect graphs and bipartite graphs
    Bhyravarapu, Sriram
    Kalyanasundaram, Subrahmanyam
    Mathew, Rogers
    THEORETICAL COMPUTER SCIENCE, 2025, 1031
  • [40] Extremal Results on Conflict-Free Coloring
    Bhyravarapu, Sriram
    Gupta, Shiwali
    Kalyanasundaram, Subrahmanyam
    Mathew, Rogers
    JOURNAL OF GRAPH THEORY, 2025,
12345