On the structure and chromaticity of graphs in which any two colour classes induce a tree (Q1377681)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the structure and chromaticity of graphs in which any two colour classes induce a tree |
scientific article; zbMATH DE number 1109959
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the structure and chromaticity of graphs in which any two colour classes induce a tree |
scientific article; zbMATH DE number 1109959 |
Statements
On the structure and chromaticity of graphs in which any two colour classes induce a tree (English)
0 references
11 August 1998
0 references
Some families of chromatically unique graphs are constructed through the partition of the vertex set of a graph \(G\) into independent sets \(A_1,A_2, \dots,A_r\) such that the subgraph of \(G\) induced by \(A_i \cup A_j\) is a tree for all \(i\) and \(j\) with \(1\leq i<j \leq r\).
0 references
chromatically unique graphs
0 references
partition
0 references
tree
0 references
