The following pages link to (Q3680861):
Displayed 11 items.
- Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs (Q326810) (← links)
- Dominating cycles in regular 3-connected graphs (Q1193714) (← links)
- On the circumferences of regular 2-connected graphs (Q1306425) (← links)
- Longest cycles in regular 2-connected claw-free graphs (Q1343791) (← links)
- Lower bounds of length of longest cycles in graphs involving neighborhood unions (Q1357727) (← links)
- Hamiltonicity of 3-connected quasi-claw-free graphs. (Q1874377) (← links)
- Hamiltonicity of 2-connected \(\{K_{1,4},K_{1,4}+e\}\)-free graphs (Q1886342) (← links)
- Circumferences of regular claw-free graphs (Q2433725) (← links)
- A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs (Q5084096) (← links)
- Cycle partitions of regular graphs (Q5886097) (← links)
- Hamilton cycles in dense regular digraphs and oriented graphs (Q6144396) (← links)