Maximal cycles in graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(17)- On some three color Ramsey numbers for paths and cycles
- The number of edges in a maximum cycle-distributed graph
- Graphs with almost all edges in long cycles
- The codiameter of a 2-connected graph
- On some three-color Ramsey numbers for paths
- scientific article; zbMATH DE number 4130423 (Why is no real title available?)
- A note on Turán numbers for even wheels
- scientific article; zbMATH DE number 4066936 (Why is no real title available?)
- scientific article; zbMATH DE number 1018607 (Why is no real title available?)
- scientific article; zbMATH DE number 7340788 (Why is no real title available?)
- Optimal maximal graphs
- Maximal buttonings of non-tree graphs
- Maximal cycles in graphs of large girth
- Edge-maximal θ2k+1-free non-bipartite Hamiltonian graphs of odd order
- A variation of an extremal theorem due to Woodall
- Cycles in 2-connected graphs
- Faces in girth-saturated graphs on surfaces
This page was built for publication: Maximal cycles in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1185084)