scientific article; zbMATH DE number 109192
From MaRDI portal
Publication:4024328
zbMATH Open0773.05064MaRDI QIDQ4024328FDOQ4024328
David K. Garnick, Nils Nieuwejaar
Publication date: 9 March 1993
Title of this publication is not available (Why is that?)
Recommendations
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Cited In (21)
- Radius \(r\) extremal graphs of girth 5
- Density of balanced 3-partite graphs without 3-cycles or 4-cycles
- Bounds on the Steiner–Wiener index of graphs
- Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs
- Graphs with maximum size and lower bounded girth
- On extremal graphs with bounded girth
- Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\)
- New families of graphs without short cycles and large size
- On extremal bipartite graphs with high girth
- Title not available (Why is that?)
- Constraints for symmetry breaking in graph representation
- On the girth of extremal graphs without shortest cycles
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
- Extremal graphs without four-cycles or five-cycles
- Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\)
- New results on EX graphs
- Title not available (Why is that?)
- No graph has a maximal 3-ring of bonds
- Extremal graphs without three‐cycles or four‐cycles
- Exact value of \(\operatorname{ex}(n; \{C_3, \ldots, C_s \})\) for \(n \leq \lfloor \frac{25(s - 1)}{8} \rfloor\)
- Size of Graphs with High Girth
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 Q4024328)
