王文杰, 张忠辅. θ-图的邻强边染色[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2004, (3).DOI:
θ-图的邻强边染色
摘要
u
v两点间连三条内部不相交的路且至多有一条长度为 1的图
称为θ-图 .本文得到了θ-图的邻强边色数
Abstract
The θ-graph is a 2-connected simple graph consisting of 3 internally disjoint paths between a pair of vertices of degree 3. Adjacent strong edge chromatic number of θ-graph is obtained in this paper.