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 |
| id |
2-s2.0-67349235610 |
|---|---|
| spelling |
2-s2.0-67349235610 Peng Y.H.; Lau G.C. Chromatic classes of 2-connected (n, n + 4)-graphs with three triangles and one induced 4-cycle 2009 Discrete Mathematics 309 10 10.1016/j.disc.2008.08.016 https://www.scopus.com/inward/record.uri?eid=2-s2.0-67349235610&doi=10.1016%2fj.disc.2008.08.016&partnerID=40&md5=972781efd18d7d949155d962b5047773 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. 0012365X English Article |
| author |
Peng Y.H.; Lau G.C. |
| spellingShingle |
Peng Y.H.; Lau G.C. Chromatic classes of 2-connected (n, n + 4)-graphs with three triangles and one induced 4-cycle |
| author_facet |
Peng Y.H.; Lau G.C. |
| author_sort |
Peng Y.H.; Lau G.C. |
| title |
Chromatic classes of 2-connected (n, n + 4)-graphs with three triangles and one induced 4-cycle |
| title_short |
Chromatic classes of 2-connected (n, n + 4)-graphs with three triangles and one induced 4-cycle |
| title_full |
Chromatic classes of 2-connected (n, n + 4)-graphs with three triangles and one induced 4-cycle |
| title_fullStr |
Chromatic classes of 2-connected (n, n + 4)-graphs with three triangles and one induced 4-cycle |
| title_full_unstemmed |
Chromatic classes of 2-connected (n, n + 4)-graphs with three triangles and one induced 4-cycle |
| title_sort |
Chromatic classes of 2-connected (n, n + 4)-graphs with three triangles and one induced 4-cycle |
| publishDate |
2009 |
| container_title |
Discrete Mathematics |
| container_volume |
309 |
| container_issue |
10 |
| doi_str_mv |
10.1016/j.disc.2008.08.016 |
| url |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-67349235610&doi=10.1016%2fj.disc.2008.08.016&partnerID=40&md5=972781efd18d7d949155d962b5047773 |
| description |
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. |
| publisher |
|
| issn |
0012365X |
| language |
English |
| format |
Article |
| accesstype |
|
| record_format |
scopus |
| collection |
Scopus |
| _version_ |
1809677914934870016 |