2010
DOI: 10.7494/opmath.2010.30.2.123
|View full text |Cite
|
Sign up to set email alerts
|

On chromatic equivalence of a pair of K4-homeomorphs

Abstract: Let P (G, λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically euqivalent, denoted G ∼ H, if P (G, λ) = P (H, λ). We write [G] = {H|H ∼ G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, we discuss a chromatically equivalent pair of graphs in one family of K4-homeomorphs, K4(1, 2, 8, d, e, f). The obtained result can be extended in the study of chromatic equivalence classes of K4(1, 2, 8, d, e, f) and chromatic uniqueness of K4-homeomorphs with g… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2010
2010
2010
2010

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 8 publications
0
0
0
Order By: Relevance