Pages that link to "Item:Q3022736"
From MaRDI portal
The following pages link to Unavoidable cycle lengths in graphs (Q3022736):
Displaying 11 items.
- On the minimal length of the longest trail in a fixed edge-density graph (Q386380) (← links)
- On the number of sets of cycle lengths (Q812791) (← links)
- Expression of a tensor commutation matrix in terms of the generalized Gell-Mann matrices (Q925370) (← links)
- Long cycles in Hamiltonian graphs (Q1717607) (← links)
- On the Erdős-Gyárfás conjecture in claw-free graphs (Q2509554) (← links)
- Triangles in graphs without bipartite suspensions (Q2699921) (← links)
- Note on graphs without repeated cycle lengths (Q4242924) (← links)
- (Q4990108) (← links)
- On 2-power unicyclic cubic graphs (Q5081236) (← links)
- Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics (Q5162867) (← links)
- A solution to Erdős and Hajnal’s odd cycle problem (Q6165143) (← links)