Chromatic classes of 2-connected (n, n + 4)-graphs with three triangles and one induced 4-cycle
For a graph G, let P (G, λ) be its chromatic polynomial. Two graphs G and H are chromatically equivalent, denoted G ∼ H, if P (G, λ) = P (H, λ). A graph G is chromatically unique if P (H, λ) = P (G, λ) implies that H ≅ G. In this paper, we shall determine all chromatic equivalence classes of 2-conne...
| Published in: | Discrete Mathematics |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
2009
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-67349235610&doi=10.1016%2fj.disc.2008.08.016&partnerID=40&md5=972781efd18d7d949155d962b5047773 |
| Summary: | For a graph G, let P (G, λ) be its chromatic polynomial. Two graphs G and H are chromatically equivalent, denoted G ∼ H, if P (G, λ) = P (H, λ). A graph G is chromatically unique if P (H, λ) = P (G, λ) implies that H ≅ G. In this paper, we shall determine all chromatic equivalence classes of 2-connected (n, n + 4)-graphs with three triangles and one induced 4-cycle, under the equivalence relation ' ∼'. As a by product of these, we obtain various new families of chromatically-equivalent graphs and chromatically-unique graphs. © 2008 Elsevier B.V. All rights reserved. |
|---|---|
| ISSN: | 0012365X |
| DOI: | 10.1016/j.disc.2008.08.016 |