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 条
  • [41] A Note on Acyclic Coloring of Strong Product of Graphs
    Babu, P. Shanas
    Chithra, A., V
    IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS, 2024, 19 (01): : 149 - 160
  • [42] Strong edge-coloring of planar graphs
    Hudak, David
    Luzar, Borut
    Sotak, Roman
    Skrekovski, Riste
    DISCRETE MATHEMATICS, 2014, 324 : 41 - 49
  • [43] A Note on the Facial Edge-Coloring Conjecture
    Jendrol', Stanislav
    Onderko, Alfred
    GRAPHS AND COMBINATORICS, 2025, 41 (02)
  • [44] Note on injective edge-coloring of graphs
    Miao, Zhengke
    Song, Yimin
    Yu, Gexin
    DISCRETE APPLIED MATHEMATICS, 2022, 310 : 65 - 74
  • [45] The Smarandachely Strong adjacent vertex total coloring of join graph
    School of Mathematics and Computer Sciences, Ningxia University, Yinchuan, 750021, China
    不详
    Int. Conf. Bioinformatics Biomed. Eng., iCBBE,
  • [46] 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)
  • [47] The Smarandachely Strong Adjacent Vertex Total Coloring of Join Graph
    Wang, Zhiwen
    Zhang, Zhongfu
    2010 4TH INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICAL ENGINEERING (ICBBE 2010), 2010,
  • [48] Acyclic Edge Coloring of Planar Graphs without Adjacent Triangles
    Dezheng XIE 1
    2.School of Mathematics and Computer Science
    Journal of Mathematical Research with Applications, 2012, (04) : 407 - 414
  • [49] Acyclic edge coloring of planar graphs without adjacent cycles
    WAN Min
    XU BaoGang
    Science China(Mathematics), 2014, 57 (02) : 433 - 442
  • [50] Upper bounds for adjacent vertex-distinguishing edge coloring
    Zhu, Junlei
    Bu, Yuehua
    Dai, Yun
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 35 (02) : 454 - 462
12345