科研之友
微信
新浪微博
Facebook
分享链接
摘要
A K-4-homeomorphic graph or simply K-4-homeomorph, denoted by K-4(a, b, c, d, e, f), is the graph obtained when the six edges of a complete graph with four vertices (K-4) 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 K-4-homeomorphs with exactly two paths of length 2.
- 出版日期2014
