On Chromatic Graphs
From MaRDI portal
Cited in
(13)- Triangles in a complete chromatic graph with three colors
- Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
- Sur les proportions respectives de triangles uni, bi ou tricolores dans un tricoloriage des aretes du n-emble
- The maximum number of induced open triangles in graphs of a given order
- On multiplicity of quadrilaterals in complete graphs
- On multiplicity of triangles
- Bounding monochromatic triangles using squares
- Maximizing the number of independent sets of a fixed size
- Asymmetric graphs
- On the maximum number of open triangles in graphs with the same number of vertices and edges
- On the maximum number of open triangles in graphs with few edges
- Planar-toroidal decomposition of \(K_{12}\)
- On graphs with small number of edges having extremal number of open triangles
This page was built for publication: On Chromatic Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3283485)