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 条
  • [21] Maximum value of conflict-free vertex-connection number of graphs
    Li, Zhenzhen
    Wu, Baoyindureng
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2018, 10 (05)
  • [22] CONFLICT-FREE VERTEX CONNECTION NUMBER AT MOST 3 AND SIZE OF GRAPHS
    Trung Duy Doan
    Schiermeyer, Ingo
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021, 41 (02) : 617 - 632
  • [23] CONFLICT-FREE COLORING OF GRAPHS
    Abel, Zachary
    Alvarez, Victor
    Demaine, Erik D.
    Fekete, Sandor P.
    Gour, Aman
    Hesterberg, Adam
    Keldenich, Phillip
    Scheffer, Christian
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (04) : 2675 - 2702
  • [24] Conflict-free colouring of graphs
    1600, Cambridge University Press (23):
  • [25] Conflict-free colouring of graphs
    1600, Cambridge University Press (23):
  • [26] Conflict-Free Colouring of Graphs
    Glebov, Roman
    Szabo, Tibor
    Tardos, Gabor
    COMBINATORICS PROBABILITY & COMPUTING, 2014, 23 (03): : 434 - 448
  • [27] The conflict-free connection number and the minimum degree-sum of graphs
    Doan, Trung Duy
    Do, Thi Thanh Chau
    Ha, Pham Hoang
    Pham, Ngoc Diep
    Schiermeyer, Ingo
    APPLIED MATHEMATICS AND COMPUTATION, 2024, 482
  • [28] The Conflict-Free Vertex-Connection Number and Degree Conditions of Graphs
    Trung Duy Doan
    Pham Hoang Ha
    Schiermeyer, Ingo
    GRAPHS AND COMBINATORICS, 2022, 38 (05)
  • [29] The Conflict-Free Vertex-Connection Number and Degree Conditions of Graphs
    Trung Duy Doan
    Pham Hoang Ha
    Ingo Schiermeyer
    Graphs and Combinatorics, 2022, 38
  • [30] Complexity of conflict-free colorings of graphs
    Gargano, Luisa
    Rescigno, Adele A.
    THEORETICAL COMPUTER SCIENCE, 2015, 566 : 39 - 49
12345