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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Elsevier Science
1997
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/51078/ 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 |
| _version_ | 1848851735888527360 |
|---|---|
| author | Peng, Yee Hock Little, Charles H. C. Teo, Kee Leong Wang, H. |
| author_facet | Peng, Yee Hock Little, Charles H. C. Teo, Kee Leong Wang, H. |
| author_sort | Peng, Yee Hock |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | 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). |
| first_indexed | 2025-11-15T10:26:55Z |
| format | Article |
| id | upm-51078 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English English |
| last_indexed | 2025-11-15T10:26:55Z |
| publishDate | 1997 |
| publisher | Elsevier Science |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-510782024-08-08T02:14:40Z http://psasir.upm.edu.my/id/eprint/51078/ Chromatic equivalence classes of certain generalized polygon trees Peng, Yee Hock Little, Charles H. C. Teo, Kee Leong Wang, H. 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). Elsevier Science 1997 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/51078/1/51078.pdf text en http://psasir.upm.edu.my/id/eprint/51078/7/1-s2.0-S0012365X96002737-main.pdf Peng, Yee Hock and Little, Charles H. C. and Teo, Kee Leong and Wang, H. (1997) Chromatic equivalence classes of certain generalized polygon trees. Discrete Mathematics, 172 (1-3). pp. 103-114. ISSN 0012-365X http://www.sciencedirect.com/science/article/pii/S0012365X96002737# 10.1016/S0012-365X(96)00273-7 |
| spellingShingle | Peng, Yee Hock Little, Charles H. C. Teo, Kee Leong Wang, H. Chromatic equivalence classes of certain generalized polygon trees |
| title | Chromatic equivalence classes of certain generalized polygon trees |
| title_full | Chromatic equivalence classes of certain generalized polygon trees |
| title_fullStr | Chromatic equivalence classes of certain generalized polygon trees |
| title_full_unstemmed | Chromatic equivalence classes of certain generalized polygon trees |
| title_short | Chromatic equivalence classes of certain generalized polygon trees |
| title_sort | chromatic equivalence classes of certain generalized polygon trees |
| url | http://psasir.upm.edu.my/id/eprint/51078/ http://psasir.upm.edu.my/id/eprint/51078/ http://psasir.upm.edu.my/id/eprint/51078/ 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 |