Chromatic uniqueness of two kinds of 2-connected (n,n+4)-graphs
From MaRDI portal
Publication:5192052
zbMATH Open1171.05335MaRDI QIDQ5192052FDOQ5192052
Authors: Jianfeng Wang, Chengfu Ye, Ru Ying Liu 
Publication date: 3 August 2009
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)
- Title not available (Why is that?)
- 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.
- Maximum chromatic polynomials of 2‐connected graphs
- Unavoidable chromatic patterns in 2‐colorings of the complete graph
- Title not available (Why is that?)
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)
