On the Maximum Number of Triangles in Wheel-Free Graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(14)- On the number of acute triangles in a straight-line embedding of a maximal planar graph
- A note on a conjecture of Gallai
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
- scientific article; zbMATH DE number 6000731 (Why is no real title available?)
- Turán problems for integer-weighted graphs
- scientific article; zbMATH DE number 637279 (Why is no real title available?)
- On maximal triangle‐free graphs
- scientific article; zbMATH DE number 1047729 (Why is no real title available?)
- scientific article; zbMATH DE number 786165 (Why is no real title available?)
- Triangle‐free graphs with large chromatic number and no induced wheel
- The maximum number of triangles in \(F_k\)-free graphs
- An extension of spectral Mantel's theorem on wheels
- Triangle-free graphs with the maximum number of cycles
This page was built for publication: On the Maximum Number of Triangles in Wheel-Free Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4306433)