Chromatic equivalence classes of certain generalized polygon trees, III
Let P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically equivalent, if P(G) = P(H). A set of graphs script S sign is called a chromatic equivalence class if for any graph H that is chromatically equivalent with a graph G in script S sign, then H∈script S sign. Pen...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2003
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/114047/1/114047.pdf |
| _version_ | 1825940428494471168 |
|---|---|
| author | Omoomi, Behnaz Peng, Yee-Hock |
| author_facet | Omoomi, Behnaz Peng, Yee-Hock |
| author_sort | Omoomi, Behnaz |
| collection | UPM |
| description | Let P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically equivalent, if P(G) = P(H). A set of graphs script S sign is called a chromatic equivalence class if for any graph H that is chromatically equivalent with a graph G in script S sign, then H∈script S sign. Peng et al. (Discrete Math. 172 (1997) 103-114), studied the chromatic equivalence classes of certain generalized polygon trees. In this paper, we continue that study and present a solution to Problem 2 in Koh and Teo (Discrete Math. 172 (1997) 59-78). |
| first_indexed | 2024-12-09T02:27:35Z |
| format | Article |
| id | upm.eprints-114047 |
| institution | Universiti Putra Malaysia |
| language | English |
| last_indexed | 2024-12-09T02:27:35Z |
| publishDate | 2003 |
| publisher | Elsevier |
| record_format | dspace |
| spelling | upm.eprints-1140472024-12-08T08:27:17Z http://psasir.upm.edu.my/id/eprint/114047/ Chromatic equivalence classes of certain generalized polygon trees, III Omoomi, Behnaz Peng, Yee-Hock Let P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically equivalent, if P(G) = P(H). A set of graphs script S sign is called a chromatic equivalence class if for any graph H that is chromatically equivalent with a graph G in script S sign, then H∈script S sign. Peng et al. (Discrete Math. 172 (1997) 103-114), studied the chromatic equivalence classes of certain generalized polygon trees. In this paper, we continue that study and present a solution to Problem 2 in Koh and Teo (Discrete Math. 172 (1997) 59-78). Elsevier 2003 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/114047/1/114047.pdf Omoomi, Behnaz and Peng, Yee-Hock (2003) Chromatic equivalence classes of certain generalized polygon trees, III. Discrete Mathematics, 271. pp. 223-234. ISSN 0012-365X https://linkinghub.elsevier.com/retrieve/pii/S0012365X02008749 10.1016/s0012-365x(02)00874-9 |
| spellingShingle | Omoomi, Behnaz Peng, Yee-Hock Chromatic equivalence classes of certain generalized polygon trees, III |
| title | Chromatic equivalence classes of certain generalized polygon trees, III |
| title_full | Chromatic equivalence classes of certain generalized polygon trees, III |
| title_fullStr | Chromatic equivalence classes of certain generalized polygon trees, III |
| title_full_unstemmed | Chromatic equivalence classes of certain generalized polygon trees, III |
| title_short | Chromatic equivalence classes of certain generalized polygon trees, III |
| title_sort | chromatic equivalence classes of certain generalized polygon trees iii |
| url | http://psasir.upm.edu.my/id/eprint/114047/1/114047.pdf |
| work_keys_str_mv | AT omoomibehnaz chromaticequivalenceclassesofcertaingeneralizedpolygontreesiii AT pengyeehock chromaticequivalenceclassesofcertaingeneralizedpolygontreesiii |