The chromaticity of complete bipartite graphs with at most one edge deleted

DOI10.1002/jgt.3190140110zbMath0712.05027OpenAlexW2054383364MaRDI QIDQ3496353

Khee Meng Koh, C. P. Teo

Publication date: 1990

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190140110

zbMATH Keywords

chromatic polynomialschromatically uniquebipartitie graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (15)

Graphs determined by polynomial invariants ⋮ The chromaticity of \(s\)-bridge graphs and related graphs ⋮ Some problems on chromatic polynomials ⋮ The search for chromatically unique graphs. II ⋮ Chromatic equivalence classes of certain generalized polygon trees ⋮ A bibliography on chromatic polynomials ⋮ On the chromatic equivalence class of graphs ⋮ The chromatic uniqueness of certain complete \(t\)-partite graphs. ⋮ Chromatic equivalence classes of complete tripartite graphs ⋮ On the chromatic uniqueness of certain bipartite graphs ⋮ The chromatic equivalence class of \(K_{1, n, n + 2}\) ⋮ On the chromaticity of complete multipartite graphs with certain edges added ⋮ Some families of chromatically unique bipartite graphs ⋮ The search for chromatically unique graphs ⋮ On chromatic uniqueness of uniform subdivisions of graphs

Cites Work

• Two classes of chromatically unique graphs
• Chromatic uniqueness of the generalized \(\Theta\)-graph

This page was built for publication: The chromaticity of complete bipartite graphs with at most one edge deleted