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 条
  • [1] Strongly Proper Connected Coloring of Graphs
    Debski, Michal
    Grytczuk, Jaroslaw
    Naroski, Pawel
    Sleszynska-Nowak, Malgorzata
    ANNALS OF COMBINATORICS, 2024, 28 (03) : 797 - 817
  • [2] SIGNED GRAPHS FROM PROPER COLORING OF GRAPHS
    Antoney, Divya
    Mangam, Tabitha Agnes
    Acharya, Mukti
    3C TECNOLOGIA, 2023, 12 (02): : 148 - 161
  • [3] Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs
    Lin, Ching-Chi
    Chang, Gerard J.
    Chen, Gen-Huey
    DISCRETE MATHEMATICS, 2007, 307 (02) : 208 - 215
  • [4] On equitable near proper coloring of graphs
    Jose, Sabitha
    Samuel, Libin Chacko
    Naduvath, Sudev
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2024, 9 (01) : 131 - 143
  • [5] On the dominator coloring in proper interval graphs and block graphs
    Panda, B. S.
    Pandey, Arti
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2015, 7 (04)
  • [6] On the Dynamic Coloring of Strongly Regular Graphs
    Akbari, S.
    Ghanbari, M.
    Jahanbekam, S.
    ARS COMBINATORIA, 2014, 113 : 205 - 210
  • [7] Fragmented coloring of proper interval and split graphs
    Diwan, Ajit
    Pal, Soumitra
    Ranade, Abhiram
    DISCRETE APPLIED MATHEMATICS, 2015, 193 : 110 - 118
  • [8] EXPONENTS OF STRONGLY CONNECTED GRAPHS
    BENDER, EA
    TUCKER, TW
    CANADIAN JOURNAL OF MATHEMATICS, 1969, 21 (04): : 769 - &
  • [9] Extremal stretch of proper-walk coloring of graphs
    Qin, Zhongmei
    Zhang, Junxue
    APPLIED MATHEMATICS AND COMPUTATION, 2021, 405
  • [10] Proper conflict-free coloring of sparse graphs
    Cho, Eun-Kyung
    Choi, Ilkyoo
    Kwon, Hyemin
    Park, Boram
    DISCRETE APPLIED MATHEMATICS, 2025, 362 : 34 - 42
12345