scientific article; zbMATH DE number 5551576
From MaRDI portal
Publication:3624955
Recommendations
- On extremal bipartite graphs with high girth
- Extremal bipartite graphs with given girth
- On the structure of extremal graphs of high girth
- On extremal bipartite graphs with a given connectivity
- Extremal graphs with bounded vertex bipartiteness number
- On extremal bipartite bicyclic graphs
- On extremal graphs with bounded girth
- scientific article; zbMATH DE number 2188339
- On the connectivity of certain graphs of high girth.
- scientific article; zbMATH DE number 5926313
Cited in
(10)- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
- Properties of certain families of \(2k\)-cycle-free graphs
- The size of bipartite graphs with a given girth
- High-girth graphs avoiding a minor are nearly bipartite
- On extremal bipartite graphs with high girth
- Extremal bipartite graphs with given girth
- On the structure of extremal graphs of high girth
- scientific article; zbMATH DE number 2188339 (Why is no real title available?)
- A Note on Bipartite Graphs Without 2 k -Cycles
- On the girth of extremal graphs without shortest cycles
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 Q3624955)
