Total coloring of series-parallel graphs

被引：0
|
作者：
Wu, JL [1 ]
Hu, DQ [1 ]
机构：
[1] Shanghai Univ Sci & Technol, Jinan 250031, Peoples R China
来源：
ARS COMBINATORIA | 2004年 / 73卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
It is proved that the total chromatic number of any series-parallel graph of degree at least 3 is Delta(G) + 1.
引用
收藏
页码：215 / 217
页数：3
相关论文
共 50 条
  • [21] On a characterization of series-parallel graphs
    Purdy, CN
    Swaminathan, R
    [J]. ARS COMBINATORIA, 1995, 41 : 163 - 175
  • [22] Boxicity of series-parallel graphs
    Bohra, Ankur
    Chandran, L. Sunil
    Raju, J. Krishnam
    [J]. DISCRETE MATHEMATICS, 2006, 306 (18) : 2219 - 2221
  • [23] ColoringWeighted Series-Parallel Graphs
    Fijavz, Gasper
    [J]. INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2006, 30 (03): : 321 - 324
  • [24] Parallel decomposition of generalized series-parallel graphs
    Hsieh, SY
    Ho, CW
    Chen, GH
    [J]. INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 890 - 896
  • [25] Parallel decomposition of generalized series-parallel graphs
    Ho, CW
    Hsieh, SY
    Chen, GH
    [J]. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 1999, 15 (03) : 407 - 417
  • [26] EFFICIENT PARALLEL ALGORITHMS FOR SERIES-PARALLEL GRAPHS
    HE, X
    [J]. JOURNAL OF ALGORITHMS, 1991, 12 (03) : 409 - 430
  • [27] Sufficient condition and algorithm for list total colorings of series-parallel graphs
    Matsuo, Yuki
    Zhou, Xiao
    Nishizeki, Takao
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2007, E90A (05) : 907 - 916
  • [28] The determination of the total chromatic number of series-parallel graphs with (G) ≥ 4
    Wang, SD
    Pang, SC
    [J]. GRAPHS AND COMBINATORICS, 2005, 21 (04) : 531 - 540
  • [29] The Determination of the Total Chromatic Number of Series-Parallel Graphs with (G) ≥ 4
    Shu-Dong Wang
    Shan-Chen Pang
    [J]. Graphs and Combinatorics, 2005, 21 : 531 - 540
  • [30] Sufficient condition and algorithm for list total colorings of series-parallel graphs
    Graduate School of Information Sciences, Tohoku University, Sendai-shi, 980-8579, Japan
    [J]. IEICE Trans Fund Electron Commun Comput Sci, 1600, 5 (907-916):
12345