The following pages link to (Q4388360):
Displaying 4 items.
- Long cycles in triangle-free graphs with prescribed independence number and connectivity (Q1826952) (← links)
- Long cycles and 3-connected spanning subgraphs of bounded degree in 3- connected \(K_{1,d}\)-free graphs (Q1892839) (← links)
- Every longest circuit of a 3‐connected,<i>K</i><sub>3,3</sub>‐minor free graph has a chord (Q3630835) (← links)
- (Q4019891) (← links)