Chromatic equivalence classes of certain generalized polygon trees
Let P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically equivalent, written G ∼ H, if P(G) = P(H). Let g denote the family of all generalized polygon trees with three interior regions. Xu (1994) showed that g is a union of chromatic equivalence classes under the e...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Elsevier Science
1997
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/51078/1/51078.pdf http://psasir.upm.edu.my/id/eprint/51078/7/1-s2.0-S0012365X96002737-main.pdf http://psasir.upm.edu.my/id/eprint/51078/ http://www.sciencedirect.com/science/article/pii/S0012365X96002737# |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Let P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically equivalent, written G ∼ H, if P(G) = P(H). Let g denote the family of all generalized polygon trees with three interior regions. Xu (1994) showed that g is a union of chromatic equivalence classes under the equivalence relation '∼'. In this paper, we determine infinitely many chromatic equivalence classes in g under '∼'. As a byproduct, we obtain a family of chromatically unique graphs established by Peng (1995). |
|---|