Chromatic equivalence classes of certain generalized polygon trees

DOI10.1016/S0012-365X(96)00273-7zbMath0883.05058OpenAlexW4212796423MaRDI QIDQ1366783

Bernhard Rupp

Publication date: 16 March 1998

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00273-7

zbMATH Keywords

chromatic polynomialchromatic equivalence classgeneralized polygon trees

Mathematics Subject Classification ID

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

Related Items (4)

The search for chromatically unique graphs. II ⋮ A bibliography on chromatic polynomials ⋮ Chromatic equivalence classes of certain generalized polygon trees. III ⋮ On minimum average stretch spanning trees in polygonal 2-trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classes of chromatically equivalent graphs and polygon trees
• The chromaticity of \(s\)-bridge graphs and related graphs
• Chromatic classes of certain 2-connected \((n,n+2)\)-graphs. II
• Another family of chromatically unique graphs
• The chromaticity of complete bipartite graphs with at most one edge deleted
• An introduction to chromatic polynomials

This page was built for publication: Chromatic equivalence classes of certain generalized polygon trees