Chromatically unique graphs
From MaRDI portal
Cites work
Cited in
(25)- On the chromatic uniqueness of bipartite graphs
- Chromatic polynomials for regular graphs and modified wheels
- On maximally saturated graphs
- On the chromatic uniqueness of certain bipartite graphs
- The chromatic uniqueness of certain broken wheels
- The chromatic uniqueness of \(W_{10}\)
- Classes of chromatically unique or equivalent graphs
- The chromaticity of certain graphs with five triangles
- Chromatic classes of 2-connected (n,n+3)-graphs with at least two triangles
- On the chromatic equivalence class of a family of graphs
- Chromatic uniqueness in a family of 2-connected graphs
- A bibliography on chromatic polynomials
- On the structure and chromaticity of graphs in which any two colour classes induce a tree
- Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles.
- All wheels with two missing consecutive spokes are chromatically unique
- The chromaticity of wheels with a missing spoke. II
- Patterns in Khovanov link and chromatic graph homology
- Chromatically unique 6-bridge graphs \(\theta(r, r, r, s, t, u)\)
- Pairs of chromatically equivalent graphs
- Classes of chromatically unique graphs
- Beta invariant and chromatic uniqueness of wheels
- The chromaticity of wheels
- The search for chromatically unique graphs
- Two classes of chromatically unique graphs
- The chromaticity of wheels with a missing spoke
This page was built for publication: Chromatically unique graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1259606)
