On the structure and chromaticity of graphs in which any two colour classes induce a tree

DOI10.1016/S0012-365X(96)00289-0zbMath0893.05004MaRDI QIDQ1377681

Fengming Dong, Khee Meng Koh

Publication date: 11 August 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

treepartitionchromatically unique graphs

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items

On graphs in which any pair of colour classes but one induces a tree, The search for chromatically unique graphs. II, A bibliography on chromatic polynomials, Structures and chromaticity of some extremal 3-colourable graphs

Cites Work

• On rigid circuit graphs
• The chromaticity of wheels
• The search for chromatically unique graphs
• The chromaticity of wheels with a missing spoke
• Chromatically unique graphs
• The search for chromatically unique graphs. II
• Onq-trees
• Lower bounds on the number of triangles in a graph
• On the join of graphs and chromatic uniqueness
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item