Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles (Q410649): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
Summary: For a graph \(G\), let \(P(G, \lambda)\) be its chromatic polynomial. Two graphs \(G\) and \(H\) are chromatically equivalent, denoted \( G \sim H\), if \(P(G, \lambda) = P(H, \lambda)\). A graph \(G\) is chromatically unique if \(P(H, \lambda) = P(G, \lambda)\) implies that \(H \cong G\). In this paper, we determine all chromatic equivalence classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles. As a byproduct of these, we obtain various new families of \(\chi\)-equivalent graphs and \(\chi\)-unique graphs. | |||
| Property / review text: Summary: For a graph \(G\), let \(P(G, \lambda)\) be its chromatic polynomial. Two graphs \(G\) and \(H\) are chromatically equivalent, denoted \( G \sim H\), if \(P(G, \lambda) = P(H, \lambda)\). A graph \(G\) is chromatically unique if \(P(H, \lambda) = P(G, \lambda)\) implies that \(H \cong G\). In this paper, we determine all chromatic equivalence classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles. As a byproduct of these, we obtain various new families of \(\chi\)-equivalent graphs and \(\chi\)-unique graphs. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C31 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6021218 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
chromatic polynomial | |||
| Property / zbMATH Keywords: chromatic polynomial / rank | |||
Normal rank | |||
Revision as of 19:28, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles |
scientific article |
Statements
Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles (English)
0 references
3 April 2012
0 references
Summary: For a graph \(G\), let \(P(G, \lambda)\) be its chromatic polynomial. Two graphs \(G\) and \(H\) are chromatically equivalent, denoted \( G \sim H\), if \(P(G, \lambda) = P(H, \lambda)\). A graph \(G\) is chromatically unique if \(P(H, \lambda) = P(G, \lambda)\) implies that \(H \cong G\). In this paper, we determine all chromatic equivalence classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles. As a byproduct of these, we obtain various new families of \(\chi\)-equivalent graphs and \(\chi\)-unique graphs.
0 references
chromatic polynomial
0 references
