Chromatically unique 6-bridge graphs (r, r, r, s, t, u)
From MaRDI portal
Publication:5084033
zbMATH Open1489.05052MaRDI QIDQ5084033FDOQ5084033
Authors: Syed Ahtsham Ul Haq Bokhary, Shehr Bano 
Publication date: 23 June 2022
Full work available at URL: https://pjm.ppu.edu/sites/default/files/papers/PJM_November_2021_191_to_202.pdf
Recommendations
Cites Work
- Title not available (Why is that?)
- Chromatic uniqueness of the generalized \(\Theta\)-graph
- The search for chromatically unique graphs
- The chromatic uniqueness of a family of 6-bridge graphs
- Chromatically unique graphs
- Some properties of chromatic coefficients of linear uniform hypergraphs
- On the chromaticity of multi-bridge hypergraphs
- Chromatically unique multibridge graphs
- Series-parallel chromatic hypergraphs
- The chromaticity of \(s\)-bridge graphs and related graphs
- Chromaticity of the graph \(\theta(a,b,c,d,e)\)
- Chromaticity of the 6-bridge graph \(\theta(a,a,a,b,c,c)\)
- A family of chromatically unique 6-bridge graphs.
- A new family of chromatically unique 6-bridge graph
- Chromatically unique 6-bridge graph theta(a,a,a,b,b,c)
- Title not available (Why is that?)
- Another proof of a family of chromatically unique 5-bridge graphs
Cited In (5)
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)
