The chromaticity of \(s\)-bridge graphs and related graphs

DOI10.1016/0012-365X(93)E0091-HzbMath0814.05036OpenAlexW2030247057MaRDI QIDQ1343275

Yeehock Peng, Jinjie Liu, Shao-Ji Xu

Publication date: 1 February 1995

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0091-h

zbMATH Keywords

chromaticitychromatically equivalentchromatically unique\(s\)-bridge graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Another family of chromatically unique graphs ⋮ The search for chromatically unique graphs. II ⋮ Chromatic equivalence classes of certain generalized polygon trees ⋮ A bibliography on chromatic polynomials ⋮ Chromaticity of series-parallel graphs ⋮ Chromatic equivalence classes of certain generalized polygon trees. III ⋮ A new family of chromatically unique 6-bridge graph ⋮ Unnamed Item ⋮ Chromatically unique 6-bridge graph theta(a,a,a,b,b,c)

Cites Work

• Chromatic uniqueness of the generalized \(\Theta\)-graph
• Classes of chromatically equivalent graphs and polygon trees
• The chromaticity of complete bipartite graphs with at most one edge deleted
• On chromatic equivalence of graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The chromaticity of \(s\)-bridge graphs and related graphs