Chromatic classes of 2-connected (n, n + 4)-graphs with three triangles and one induced 4-cycle

Chromatic classes of 2-connected (n, n + 4)-graphs with three triangles and one induced 4-cycle

Show other versions (1)

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

Full description

Bibliographic Details
Main Authors: Lau, G.C (Author), Peng, Y.H (Author)
Format: Article
Language:English
Subjects:
4 cycles
By products
Chromatic polynomial
Chromatically equivalent graph
Chromatically unique graph
Equivalence classes
Equivalence relations
Graph g
Polynomial approximation
Relative-closed
Set theory
Two-graphs
Online Access:View Fulltext in Publisher
View in Scopus
Description
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.
ISBN:0012365X (ISSN)
DOI:10.1016/j.disc.2008.08.016

Similar Items