Strongly proper connected coloring of graphs

被引：0
|
作者：
Dębski, Michal [1 ]
Grytczuk, Jaroslaw [1 ]
Naroski, Pawel [1 ]
Śleszyńska-Nowak, Malgorzata [1 ]
机构：
[1] Faculty of Mathematics and Information Science, Warsaw University of Technology, Warsaw, Poland
来源：
arXiv | 2023年
关键词：
Engineering Village;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
2-connected graphs - 4-connected - Color sequence - Connected graph - Cycle length - Graph G - Graph-based - Induced matchings - Strong edge coloring - Upper Bound
引用
收藏
相关论文
共 50 条
  • [21] Connected greedy coloring of H-free graphs
    Mota, Esdras
    Rocha, Leonardo
    Silva, Ana
    DISCRETE APPLIED MATHEMATICS, 2020, 284 (284) : 572 - 584
  • [22] The algorithm for adjacent vertex distinguishing proper edge coloring of graphs
    Li, Jingwen
    Hu, Tengyun
    Wen, Fei
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2015, 7 (04)
  • [23] A note on the vertex-distinguishing proper total coloring of graphs
    Li, Jingwen
    Wang, Zhiwen
    Zhang, Zhongfu
    Zhu, Enqiang
    Wan, Fei
    Wang, Hongjie
    ARS COMBINATORIA, 2010, 96 : 421 - 423
  • [24] A note on the vertex-distinguishing proper edge coloring of graphs
    Zhu, Enqiang
    Liu, Chanjuan
    ARS COMBINATORIA, 2014, 116 : 93 - 99
  • [25] AVD proper edge-coloring of some families of graphs
    Naveen, J.
    INTERNATIONAL JOURNAL OF MATHEMATICS FOR INDUSTRY, 2021, 13 (01):
  • [26] Template-driven rainbow coloring of proper interval graphs
    Chandran, L. Sunil
    Das, Sajal K.
    Hell, Pavol
    Padinhatteeri, Sajith
    Pillai, Raji R.
    DISCRETE APPLIED MATHEMATICS, 2023, 328 : 97 - 107
  • [27] Observability in Connected Strongly Regular Graphs and Distance Regular Graphs
    Kibangou, Alain Y.
    Commault, Christian
    IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2014, 1 (04): : 360 - 369
  • [28] Triggering Cascades on Strongly Connected Directed Graphs
    Chang, Ching-Lueh
    Lyuu, Yuh-Dauh
    2012 FIFTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND PROGRAMMING (PAAP), 2012, : 95 - 99
  • [29] Counting orientations of graphs with no strongly connected tournaments
    Botler, Fabio
    Hoppen, Carlos
    Mota, Guilherme Oliveira
    DISCRETE MATHEMATICS, 2022, 345 (12)
  • [30] Strongly 2-connected orientations of graphs
    Thomassen, Carsten
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2015, 110 : 67 - 78
12345