Chromatic equivalence classes of certain generalized polygon trees

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...

Full description

Bibliographic Details
Main Authors: Peng, Yee Hock, Little, Charles H. C., Teo, Kee Leong, Wang, H.
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

Similar Items

Similar Items