Parity and strong parity edge-colorings of graphs

淡江大學機構典藏 > 理學院 > 數學學系暨研究所 > 期刊論文 > Item 987654321/115409

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/115409

题名:	Parity and strong parity edge-colorings of graphs
作者:	Hsiang-Chun Hsu;Gerard Jennhwa Chang
关键词:	(Strong) parity edge-coloring;(Strong) parity edge-chromatic number;Hypercube embedding;Hopt-Stiefel function;Product of graphs
日期:	2012-11-30
上传时间:	2018-10-25 12:11:04 (UTC+8)
出版者:	Springer US
摘要:	A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. A parity edge-coloring (respectively, strong parity edge-coloring) is an edge-coloring in which there is no nontrivial parity path (respectively, open parity walk). The parity edge-chromatic number p(G) (respectively, strong parity edge-chromatic number pˆ(G) ) is the least number of colors in a parity edge-coloring (respectively, strong parity edge-coloring) of G. Notice that pˆ(G)≥p(G)≥χ′(G)≥Δ(G) for any graph G. In this paper, we determine pˆ(G) and p(G) for some complete bipartite graphs and some products of graphs. For instance, we determine pˆ(Km,n) and p(K m,n ) for m≤n with n≡0,−1,−2 (mod 2⌈lg m⌉).
關聯:	Journal of Combinatorial Optimization 24(4), p.427-436
DOI:	10.1007/s10878-011-9398-y
显示于类别:	[數學學系暨研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	90	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章