On graphs in which any pair of colour classes but one induces a tree
From MaRDI portal
Publication:1357722
DOI10.1016/0012-365X(95)00331-PzbMath0874.05023MaRDI QIDQ1357722
Publication date: 20 October 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05C75: Structural characterization of families of graphs
05C15: Coloring of graphs and hypergraphs
Related Items
Structures and chromaticity of some extremal 3-colourable graphs, The search for chromatically unique graphs. II, A bibliography on chromatic polynomials, On the chromatic equivalence class of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On rigid circuit graphs
- The chromaticity of wheels
- The search for chromatically unique graphs
- The chromaticity of wheels with a missing spoke
- A note on the chromatic uniqueness of \(W_ 10\)
- The chromatic uniqueness of \(W_{10}\)
- The search for chromatically unique graphs. II
- On the structure and chromaticity of graphs in which any two colour classes induce a tree
- On the chromaticity of certain subgraphs of a q-tree
- Onq-trees
- Lower bounds on the number of triangles in a graph