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

DOI10.1016/S0012-365X(96)00289-0zbMATH Open0893.05004MaRDI QIDQ1377681FDOQ1377681

F. M. Dong, K. M. 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Onq-trees
• On rigid circuit graphs
• Lower bounds on the number of triangles in a graph
• The search for chromatically unique graphs
• On the join of graphs and chromatic uniqueness
• The search for chromatically unique graphs. II
• Chromatically unique graphs
• The chromaticity of wheels
• The chromaticity of wheels with a missing spoke

Cited In (4)

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

This page was built for publication: On the structure and chromaticity of graphs in which any two colour classes induce a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377681)