Chromatically unique 6-bridge graphs (r, r, r, s, t, u)
From MaRDI portal
Publication:5084033
Recommendations
Cites work
- scientific article; zbMATH DE number 5953922 (Why is no real title available?)
- scientific article; zbMATH DE number 2199828 (Why is no real title available?)
- A family of chromatically unique 6-bridge graphs.
- A new family of chromatically unique 6-bridge graph
- Another proof of a family of chromatically unique 5-bridge graphs
- Chromatic uniqueness of the generalized \(\Theta\)-graph
- Chromatically unique 6-bridge graph \(\theta(a,a,a,b,b,c)\)
- Chromatically unique graphs
- Chromatically unique multibridge graphs
- Chromaticity of the 6-bridge graph \(\theta(a,a,a,b,c,c)\)
- Chromaticity of the graph \(\theta(a,b,c,d,e)\)
- On the chromaticity of multi-bridge hypergraphs
- Series-parallel chromatic hypergraphs
- Some properties of chromatic coefficients of linear uniform hypergraphs
- The chromatic uniqueness of a family of 6-bridge graphs
- The chromaticity of \(s\)-bridge graphs and related graphs
- The search for chromatically unique graphs
Cited in
(7)- A new family of chromatically unique 6-bridge graph
- The chromatic uniqueness of 6-bridge graphs
- The chromatic uniqueness of a family of 6-bridge graphs
- A family of chromatically unique 6-bridge graphs.
- Chromaticity of the 6-bridge graph \(\theta(a,a,a,b,c,c)\)
- Chromatically unique 6-bridge graph \(\theta(a,a,a,b,b,c)\)
- The chromaticity of \(s\)-bridge graphs and related graphs
This page was built for publication: Chromatically unique 6-bridge graphs \(\theta(r, r, r, s, t, u)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084033)