On chromatic uniqueness of uniform subdivisions of graphs

DOI10.1016/0012-365X(94)90123-6zbMath0796.05034OpenAlexW1990686017MaRDI QIDQ1322194

C. P. Teo, Khee Meng Koh

Publication date: 15 September 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90123-6

zbMATH Keywords

chromatically equivalentchromatically uniquechromatic polnomialsuniform subdivisions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The search for chromatically unique graphs. II ⋮ A bibliography on chromatic polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• The search for chromatically unique graphs
• On the chromatic uniqueness of bipartite graphs
• Graphs such that every two edges are contained in a shortest cycle
• Cutpoints and the chromatic polynomial
• The chromaticity of complete bipartite graphs with at most one edge deleted
• On 3-colorings of bipartitep-threshold graphs
• Cages—a survey
• The number of shortest cycles and the chromatic uniqueness of a graph
• On chromatic equivalence of graphs

This page was built for publication: On chromatic uniqueness of uniform subdivisions of graphs