Chromatic equivalence classes of certain generalized polygon trees. III

DOI10.1016/S0012-365X(02)00874-9zbMath1021.05035OpenAlexW2031605019MaRDI QIDQ1408878

D. Massart

Publication date: 25 September 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00874-9

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

On minimum average stretch spanning trees in polygonal 2-trees

Cites Work

• Unnamed Item
• Unnamed Item
• The search for chromatically unique graphs
• The chromaticity of \(s\)-bridge graphs and related graphs
• The search for chromatically unique graphs. II
• Chromatic equivalence classes of certain generalized polygon trees
• Chromatic equivalence classes of certain cycles with edges