The following pages link to Cycle lengths in sparse graphs (Q949802):
Displaying 43 items.
- Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs (Q405113) (← links)
- Cycle spectra of Hamiltonian graphs (Q444376) (← links)
- The extremal function for cycles of length \(\ell\) mod \(k\) (Q510312) (← links)
- Cycles in graphs of fixed girth with large size (Q518183) (← links)
- A randomized embedding algorithm for trees (Q555509) (← links)
- Hamilton cycles in highly connected and expanding graphs (Q624184) (← links)
- Cycles with consecutive odd lengths (Q896065) (← links)
- Pancyclicity of Hamiltonian and highly connected graphs (Q974472) (← links)
- On the sum of the reciprocals of cycle lengths in sparse graphs (Q1068848) (← links)
- Cycle factors in dense graphs (Q1292839) (← links)
- The number of cycle lengths in graphs of given minimum degree and girth (Q1301632) (← links)
- Listing all fixed-length simple cycles in sparse graphs in optimal time (Q1679990) (← links)
- Cycle lengths and minimum degree of graphs (Q1682209) (← links)
- Cycles in triangle-free graphs of large chromatic number (Q1743172) (← links)
- Cycles of given lengths in hypergraphs (Q1791703) (← links)
- Distribution of cycle lengths in graphs (Q1850584) (← links)
- On some cycles in Wenger graphs (Q1987600) (← links)
- Cycle lengths in expanding graphs (Q2036619) (← links)
- Cycle lengths modulo \(k\) in expanders (Q2111188) (← links)
- Generalized Turán problems for even cycles (Q2200921) (← links)
- Gaps in the cycle spectrum of 3-connected cubic planar graphs (Q2221919) (← links)
- On a conjecture of Bondy and Vince (Q2284740) (← links)
- Subdivisions of a large clique in \(C_6\)-free graphs (Q2343284) (← links)
- Circumference, chromatic number and online coloring (Q2439828) (← links)
- Ramsey results for cycle spectra (Q2853338) (← links)
- Unavoidable cycle lengths in graphs (Q3022736) (← links)
- Cycle length parities and the chromatic number (Q3055917) (← links)
- Approximating the Longest Cycle Problem in Sparse Graphs (Q3149885) (← links)
- On the distribution of cycle lengths in graphs (Q3344236) (← links)
- Cycles of Given Size in a Dense Graph (Q3455245) (← links)
- The number of shortest cycles and the chromatic uniqueness of a graph (Q3990870) (← links)
- (Q4990108) (← links)
- On 2-power unicyclic cubic graphs (Q5081236) (← links)
- Cycles of many lengths in Hamiltonian graphs (Q5102252) (← links)
- A Strengthening on Odd Cycles in Graphs of Given Chromatic Number (Q5157394) (← links)
- Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics (Q5162867) (← links)
- On the spectra of large sparse graphs with cycles (Q5416321) (← links)
- Cycles in graphs with small density (Q5946793) (← links)
- Linear cycles of consecutive lengths (Q6051045) (← links)
- A Lower Bound on Cycle-Finding in Sparse Digraphs (Q6058259) (← links)
- A solution to Erdős and Hajnal’s odd cycle problem (Q6165143) (← links)
- Generalized Turán problems for even cycles (Q6621207) (← links)
- The automorphism group of projective norm graphs (Q6631553) (← links)
