In this paper, we completely determine the chromaticity of K4-homeomorphs which has girth 9, and give suffi cient and necessary condition for the graphs in the ...

We obtain a large family of chromatically unique K4 homeomorphs. We obtain seven infinite pairs of chromatically equivalent nonisomorphic. K4 homeomorphs. 1.

The result in this paper completes the study on the chromaticity of K4-homeomorphs with exactly two paths of length 2. Keywords: chromatic polynomial ...

A graph G is chromatically unique if for any graph H such that H ∼ G , we have H ≅ G , i.e., H is isomorphic to G .

Oct 22, 2024 · A K4 homeomorph can be described as a graph on n vertices having 4 vertices of degree 3 and n − 4 vertices of degree 2; each pair of degree 3 ...

We shall investigate the chromaticity of K4-homeomorph with exactly two adjacent paths of length two and exactly one path of length one.

A graph G is chromatically unique (or simply χ−unique) if for any graph H such that H ∼ G, we have H ∼= G, i.e, H is isomorphic to G. a b c d e f. 3. 3. 4 d.

A graph G is chromatically unique if for any graph H such that H ∼ G , we have H ≅ G , i.e., H is isomorphic to G . A ...

In this paper, we discuss a pair of chromatically equivalent of K4-homeomorphs of girth 11, that is, K4(1,3,7,d,e,f) and K4(1,3,7,d ,e ,f ).

We discuss the chromaticity of one family of K 4 -homeomorphs with exactly two non-adjacent paths of length two, where the other four paths are of length ...