An effcient algorithm for the nearly equitable edge coloring problem

被引:1
|
作者
Graduate School of Information Science, Nagoya University, Nagoya 464-8603, Japan [1 ]
不详 [2 ]
机构
来源
J. Graph Algorithms and Appl. | 2008年 / 4卷 / 383-399期
关键词
Directed graphs;
D O I
10.7155/jgaa.00171
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [31] The equitable edge-coloring of series-parallel graphs
    Song, Huimin
    Wu, Jianliang
    Liu, Guizhen
    COMPUTATIONAL SCIENCE - ICCS 2007, PT 3, PROCEEDINGS, 2007, 4489 : 457 - +
  • [32] On the Adjacent Vertex-distinguishing Equitable Edge Coloring of Graphs
    Jing-wen LI
    Cong WANG
    Zhi-wen WANG
    Acta Mathematicae Applicatae Sinica, 2013, (03) : 615 - 622
  • [33] On the Adjacent Vertex-distinguishing Equitable Edge Coloring of Graphs
    Jingwen LI
    Cong WANG
    Zhiwen WANG
    Acta Mathematicae Applicatae Sinica(English Series), 2013, 29 (03) : 615 - 622
  • [34] On the Adjacent Vertex-distinguishing Equitable Edge Coloring of Graphs
    Li, Jing-wen
    Wang, Cong
    Wang, Zhi-wen
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2013, 29 (03): : 615 - 622
  • [35] EQUITABLE COLORING
    MEYER, W
    AMERICAN MATHEMATICAL MONTHLY, 1973, 80 (08): : 920 - 922
  • [36] Remarks on an Edge-coloring Problem
    Hoppen, Carlos
    Lefmann, Hanno
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2019, 346 : 511 - 521
  • [37] A Coloring Solution to the Edge Crossing Problem
    Jianu, Radu
    Rusu, Adrian
    Fabian, Andrew J.
    Laidlaw, David H.
    INFORMATION VISUALIZATION, IV 2009, PROCEEDINGS, 2009, : 691 - +
  • [38] On f-Edge Cover Coloring of Nearly Bipartite Graphs
    Li, Jinbo
    Liu, Guizhen
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2011, 34 (02) : 247 - 253
  • [39] A NOTE ON EDGE-COVER COLORING OF NEARLY BIPARTITE GRAPHS
    Xu, Changqing
    Jia, Yanbin
    ARS COMBINATORIA, 2009, 91 : 423 - 427
  • [40] An edge coloring problem for graph products
    Faudree, RJ
    Gyarfas, A
    Schelp, RH
    JOURNAL OF GRAPH THEORY, 1996, 23 (03) : 297 - 302