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 条
  • [31] The number of edges in critical strongly connected graphs
    Aharoni, R.
    Berger, E.
    1600, Elsevier Science B.V. (234): : 1 - 3
  • [32] The number of edges in critical strongly connected graphs
    Aharoni, R
    Berger, E
    DISCRETE MATHEMATICS, 2001, 234 (1-3) : 119 - 123
  • [33] Finding strongly connected components in distributed graphs
    McLendon, W
    Hendrickson, B
    Plimpton, SJ
    Rauchwerger, L
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2005, 65 (08) : 901 - 910
  • [34] Triggering cascades on strongly connected directed graphs
    Chang, Ching-Lueh
    Lyuu, Yuh-Dauh
    THEORETICAL COMPUTER SCIENCE, 2015, 593 : 62 - 69
  • [35] COMPETITION GRAPHS OF STRONGLY CONNECTED AND HAMILTONIAN DIGRAPHS
    FRAUGHNAUGH, KF
    LUNDGREN, JR
    MERZ, SK
    MAYBEE, JS
    PULLMAN, NJ
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1995, 8 (02) : 179 - 185
  • [36] C-MINIMAL STRONGLY CONNECTED GRAPHS
    CHATY, G
    COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1968, 266 (18): : 907 - &
  • [37] Counting orientations of graphs with no strongly connected tournaments
    Botler, Fabio
    Hoppen, Carlos
    Mota, Guilherme Oliveira
    PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2021, 195 : 385 - 393
  • [38] The Strongly Rainbow Connected Number of the Inverse Graphs
    Kameswari, M. Lakshmi
    MaruthiKumari, N. Naga
    Kumar, T. V. Pradeep
    JOURNAL OF PHARMACEUTICAL NEGATIVE RESULTS, 2022, 13 : 1817 - 1827
  • [39] On the adjacent-vertex-strongly-distinguishing total coloring of graphs
    ZHANG ZhongFu~(1
    Science in China(Series A:Mathematics), 2008, (03) : 427 - 436
  • [40] On the adjacent-vertex-strongly-distinguishing total coloring of graphs
    Zhang Zhongfu
    Cheng Hui
    Yao Bing
    Li Jingwen
    Chen Xiangen
    Xu Baogen
    SCIENCE IN CHINA SERIES A-MATHEMATICS, 2008, 51 (03): : 427 - 436
12345