On the chromatic uniqueness of bipartite graphs

DOI10.1016/0012-365X(86)90146-9zbMath0594.05034MaRDI QIDQ1076684

Pablo M. Salzberg, Miguel A. López, Reinaldo E. Giudici

Publication date: 1986

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

zbMATH Keywords

bipartite graphspolynomialchromatically equivalent graphschromatic uniqueness4-cycleschromatic

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

A bibliography on chromatic polynomials ⋮ Counting pure \(k\)-cycles in sequences of Cayley graphs ⋮ Two classes of chromatically unique graphs ⋮ On the chromatic uniqueness of certain bipartite graphs ⋮ The chromatic uniqueness of complete bipartite graphs ⋮ Classes of chromatically unique graphs ⋮ On the chromaticity of complete multipartite graphs with certain edges added ⋮ The search for chromatically unique graphs ⋮ On chromatic uniqueness of uniform subdivisions of graphs

Cites Work

• On chromatic coefficients
• Chromatically unique graphs
• Parallel concepts in graph theory
• Cutpoints and the chromatic polynomial
• An introduction to chromatic polynomials
• Unnamed Item
• Unnamed Item

This page was built for publication: On the chromatic uniqueness of bipartite graphs