The equitable edge-coloring of series-parallel graphs

被引：0

作者：

Song, Huimin ^{[1
]}

Wu, Jianliang ^{[2
]}

Liu, Guizhen ^{[2
]}

机构：

[1] Shandong Univ, Dept Appl Math, Weihai 264209, Peoples R China

[2] Shandong Univ, Sch Math & Syst Sci, Jinan 250100, Peoples R China

来源：

COMPUTATIONAL SCIENCE - ICCS 2007, PT 3, PROCEEDINGS | 2007年 / 4489卷

关键词：

edge-coloring; equitable; series-parallel graph;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

An edge-coloring of a graph G is equitable if, for each vertex v of G, the number of edges of any one color incident with v differs from the number of edges of any other color incident with v by at most one. A graph G is called equitable if G has an equitable edge-coloring with k colors for any integer k >= 1. A plane graph is series-parallel graph if it contains no subgraphs horneomorphic to K-4. In the paper, we prove that any simple and connected series-parallel graph is equitable if and only if it is not an odd circuit.

引用

页码：457 / +

页数：2