Chromatically equivalent k-bridge hypergraphs

MaRDI QIDQ5412979zbMATH OpenFDO

Authors Sana Javed, Ioan Tomescu

Publication date 28 April 2014

zbMATH Keywords

\(k\)-bridge hypergraphchromatic polynomialchromatically equivalent hypergraphslinear path

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• On the chromaticity of multi-bridge hypergraphs
• A note on chromaticity of k-bridge graphs
• On k-chromatically unique and k-chromatically equivalent hypergraphs
• The chromaticity of s-bridge graphs and related graphs
• On 3-chromatically unique and 3-chromatically equivalent hypergraphs

Cited in

(1)

• On the chromaticity of multi-bridge hypergraphs

This page was built for publication: Chromatically equivalent \(k\)-bridge hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5412979)