Girth of \C₃, , C_s\-free extremal graphs
From MaRDI portal
Publication:423957
DOI10.1016/J.DAM.2012.01.020zbMATH Open1243.05118OpenAlexW1819560410MaRDI QIDQ423957FDOQ423957
C. Balbuena, A. Diánez, E. Abajo
Publication date: 30 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.01.020
Recommendations
Cites Work
- Title not available (Why is that?)
- The nonexistence of certain generalized polygons
- On Moore Graphs with Diameters 2 and 3
- Minimal Regular Graphs of Girths Eight and Twelve
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Moore bound for irregular graphs
- Extremal graphs without three‐cycles or four‐cycles
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
- Title not available (Why is that?)
- Graphs with maximum size and lower bounded girth
- On the structure of extremal graphs of high girth
- Title not available (Why is that?)
- On the Minimum Order of Extremal Graphs to have a Prescribed Girth
- Using simulated annealing to construct extremal graphs
- Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\)
- New families of graphs without short cycles and large size
- On the girth of extremal graphs without shortest cycles
Cited In (2)
This page was built for publication: Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423957)