Abstract
A K4-homeomorphic graph or simply K4-homeomorph, denoted by K4(a, b, c, d, e, f), is the graph obtained when the six edges of a complete graph with four vertices (K4) are subdivided into a, b, c, d, e, f segments, respectively. Each subdivided edge is called a path and its length is the number of resulting segments. The result in this paper completes the study on the chromaticity of K4-homeomorphs with exactly two paths of length 2.
2000 AMS Subject Classification:
Acknowledgements
The authors would like to extend their sincere thanks to the referees for their constructive and valuable comments.