On the chromatic equivalence class of graphs (Q1377862): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Gek Ling Chia / rank | |||
Property / reviewed by | |||
Property / reviewed by: Dan S. Archdeacon / rank | |||
Property / author | |||
Property / author: Gek Ling Chia / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Dan S. Archdeacon / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On trees of polygons / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Onq-trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on chromatic uniqueness of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3824333 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the chromatic equivalence class of a family of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3990580 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On graphs in which any pair of colour classes but one induces a tree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3682505 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5572939 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4044590 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4031916 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An introduction to chromatic polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3832608 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3243274 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The chromaticity of complete bipartite graphs with at most one edge deleted / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the chromaticity of certain subgraphs of a q-tree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chromaticity of two-trees / 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 09:33, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the chromatic equivalence class of graphs |
scientific article |
Statements
On the chromatic equivalence class of graphs (English)
0 references
10 August 1999
0 references
Let \(P(G, \lambda)\) denote the chromatic polynomial of a graph \(G\). Two graphs \(G\) and \(H\) are chromatically equivalent if \(P(G,\lambda) = P(H,\lambda)\). The chromatic equivalence class of \(G\) consists of all graphs chromatically equivalent to \(G\). For example, the chromatic equivalence class of a tree consists of exactly all other trees of the same order. The join of two graphs \(G\) and \(H\) is obtained by taking a disjoint copy of each graph and adding edges from every vertex of \(G\) to every vertex of \(H\). The author determines the class of all graphs in the chromatic equivalence class of the join of \(m\) copies of paths each of length 3. He also gives two operations, which when applied to graphs in the chromatic equivalence class of \(G\), give all graphs with chromatic polynomial \(\lambda P(G,\lambda)\). A similar result is given for all graphs with chromatic polynomial \((\lambda -1) P(G,\lambda)\).
0 references
chromatic polynomial
0 references
chromatic equivalence class
0 references