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 |
ReferenceBot (talk | contribs) Changed an Item |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / author | |||
Property / author: Yee-Hock Peng / rank | |||
Property / author | |||
Property / author: Yee-Hock Peng / rank | |||
Normal rank | |||
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 | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58689414 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.5402/2011/430396 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1539886823 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On chromatic equivalence of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chromatic uniqueness of the generalized \(\Theta\)-graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the chromaticity of some 2-connected \((n,n+3)\)-graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4000770 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4187840 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The coloring of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cutpoints and the chromatic polynomial / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:45, 5 July 2024
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
0 references