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 |
| Sprog: | English |
| Udgivet: |
Elsevier
2003
|
| Online adgang: | http://psasir.upm.edu.my/id/eprint/114047/1/114047.pdf |