Pages that link to "Item:Q1375625"
From MaRDI portal
The following pages link to Estimations for the number of cycles in a graph (Q1375625):
Displaying 7 items.
- Cycle-maximal triangle-free graphs (Q472981) (← links)
- Triangle-free graphs with the maximum number of cycles (Q898130) (← links)
- Proof of Komlós's conjecture on Hamiltonian subsets (Q1689999) (← links)
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems (Q2357824) (← links)
- On graphs with equal domination and 2-domination numbers (Q2483412) (← links)
- On the maximum number of cycles in a Hamiltonian graph (Q2576841) (← links)
- The ratio of the numbers of odd and even cycles in outerplanar graphs (Q2685320) (← links)
