Chromatic uniqueness of two kinds of 2-connected (n,n+4)-graphs
From MaRDI portal
Publication:5192052
Recommendations
- scientific article; zbMATH DE number 54779
- Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles.
- Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle
- Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles
- Chromatic uniqueness in a family of 2-connected graphs
Cited in
(7)- Maximum chromatic polynomials of 2‐connected graphs
- Chromatic classes of a class of \(2\)-connected \((n,n+2)\) graphs
- A note on the chromaticity of some 2-connected \((n,n+3)\)-graphs
- Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles.
- scientific article; zbMATH DE number 4108817 (Why is no real title available?)
- Unavoidable chromatic patterns in 2‐colorings of the complete graph
- scientific article; zbMATH DE number 54779 (Why is no real title available?)
This page was built for publication: Chromatic uniqueness of two kinds of 2-connected \((n,n+4)\)-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5192052)
