×

Chromaticity of the graph \(\theta(a,b,c,d,e)\). (Chinese. English summary) Zbl 0964.05511

Summary: The graph \(\theta(a,b,c,d,e)\) is a 2-connected graph consisting of 5 internally disjoint paths between a pair of vertices of degree 5. The lengths of those paths are \(a,b,c,d,e\) respectively, where \(a\leq b\leq c\leq d\leq e\). The chromaticity of the graph \(\theta(a,b,c,d,e)\) is discussed in this paper. A sufficient condition for the graph \(\theta(a,b,c,d,e)\) to be chromatically unique is obtained.

MSC:

05C15 Coloring of graphs and hypergraphs
PDF BibTeX XML Cite