Pages that link to "Item:Q2851535"
From MaRDI portal
The following pages link to On extremal graphs with bounded girth (Q2851535):
Displaying 23 items.
- Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs (Q423957) (← links)
- Graphs with maximum size and lower bounded girth (Q427676) (← links)
- New classes of extremal graphs with given bandwidth (Q489353) (← links)
- Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\) (Q608265) (← links)
- Graphs of bounded degree and the \(p\)-harmonic boundary (Q611877) (← links)
- New results on EX graphs (Q626971) (← links)
- On the girth of extremal graphs without shortest cycles (Q998448) (← links)
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) (Q1026123) (← links)
- Extremal graphs with prescribed circumference and cocircumference (Q1587614) (← links)
- The \(b\)-continuity of graphs with large girth (Q1684929) (← links)
- Extremal graphs without cycles of length 8 or less (Q2857416) (← links)
- Maximizing the size of planar graphs under girth constraints (Q2875897) (← links)
- The constructions and the judgement algorithms about G-extremal graphs and G-near-extremal graphs (Q2926814) (← links)
- (Q3139287) (← links)
- Calculating the extremal number (Q3439553) (← links)
- Size of Graphs with High Girth (Q3503470) (← links)
- (Q3624955) (← links)
- Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille (Q3644810) (← links)
- Extremal graphs without three‐cycles or four‐cycles (Q4271621) (← links)
- On the structure of extremal graphs of high girth (Q4364808) (← links)
- (Q4717030) (← links)
- (Q4871035) (← links)
- Using simulated annealing to construct extremal graphs (Q5937924) (← links)
