scientific article; zbMATH DE number 54779
From MaRDI portal
Publication:4000770
Recommendations
- Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles.
- Chromatic classes of 2-connected (n,n+3)-graphs with at least two 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 of two kinds of 2-connected (n,n+4)-graphs
Cited in
(14)- Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle
- Structures and chromaticity of some extremal 3-colourable graphs
- Chromatic classes of 2-connected (n,n+3)-graphs with at least two triangles
- Chromatic classes of certain 2-connected \((n,n+2)\)-graphs homeomorphic to \(K_ 4\)
- Chromatic classes of certain 2-connected \((n,n+2)\)-graphs. II
- The search for chromatically unique graphs. II
- Chromatic equivalence classes of certain generalized polygon trees
- A bibliography on chromatic polynomials
- Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles.
- Chromatic classes of a class of 2-connected (n,n+2) graphs
- Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles
- The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number six
- Chromatic uniqueness of two kinds of 2-connected (n,n+4)-graphs
- The search for chromatically unique graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4000770)
