A note on adjacent strong edge coloring of K(n,m)

被引：0
|
作者：
Li J.-W. [1 ]
Zhang Z.-F. [2 ,3 ]
Chen X.-E. [3 ]
Sun Y.-R. [3 ]
机构：
[1] College of Information and Electrical Engineering, Lanzhou Jiaotong University
[2] Institute of Applied Mathematics, Lanzhou Jiaotong University
[3] College of Mathematics and Information Science, Northwest Normal University
来源：
Acta Mathematicae Applicatae Sinica | 2006年 / 22卷 / 2期
基金：
中国国家自然科学基金;
关键词：
Adjacent strong edge coloring; Coloring; Edge coloring;
D O I：
10.1007/s10255-006-0303-x
中图分类号：
学科分类号：
摘要：
In this paper, we prove that the adjacent strong edge chromatic number of a graph K(n,m) is n + 1, with n ≥ 2,m ≥ 1. © Springer-Verlag 2006.
引用
收藏
页码：273 / 276
页数：3
相关论文
共 50 条
  • [1] Adjacent strong edge coloring of graphs
    Zhang, ZF
    Liu, LZ
    Wang, JF
    APPLIED MATHEMATICS LETTERS, 2002, 15 (05) : 623 - 626
  • [2] Adjacent strong edge coloring of extended θ-graph
    Zhang, Zheng-Cheng
    Zhang, Zhong-Fu
    Huabei Gongxueyuan Xuebao/Journal of North China Institute of Technology, 2003, 24 (06):
  • [3] A Note on Strong Edge Coloring of Sparse Graphs
    Wei DONG
    Rui LI
    Bao Gang XU
    Acta Mathematica Sinica,English Series, 2019, (04) : 577 - 582
  • [4] A Note on Strong Edge Coloring of Sparse Graphs
    Wei Dong
    Rui Li
    Bao Gang Xu
    Acta Mathematica Sinica, English Series, 2019, 35 : 577 - 582
  • [5] A note on adjacent vertex distinguishing edge coloring of graphs
    Jia, Xiuqing
    Wen, Fei
    Li, Zepeng
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2025,
  • [6] A Note on Strong Edge Coloring of Sparse Graphs
    Wei DONG
    Rui LI
    Bao Gang XU
    Acta Mathematica Sinica, 2019, 35 (04) : 577 - 582
  • [7] A Note on Strong Edge Coloring of Sparse Graphs
    Dong, Wei
    Li, Rui
    Xu, Bao Gang
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2019, 35 (04) : 577 - 582
  • [8] The adjacent strong edge chromatic number of P-1 v K-m,(n) and C-2 v K-m,n
    Sun, Zongjian
    Chen, Jing
    INTERNATIONAL JOURNAL OF MODELLING IDENTIFICATION AND CONTROL, 2011, 13 (03) : 221 - 224
  • [9] A note on list edge coloring of planar graphs without adjacent short cycles
    Hu, Linna
    Song, Huimin
    Wu, Jian-Liang
    ARS COMBINATORIA, 2019, 143 : 3 - 12
  • [10] The adjacent strong edge chromatic number of P4 v K-m,K-n and C5 v K-m,K-n
    Sun, Zongjian
    Chen, Jing
    Chen, Qian
    INTERNATIONAL JOURNAL OF MODELLING IDENTIFICATION AND CONTROL, 2012, 16 (03) : 297 - 300
12345