Pages that link to "Item:Q1426102"

The following pages link to Cycles through a prescribed vertex set in \(n\)-connected graphs. (Q1426102):

Displaying 8 items.

• Cycles through \(k+2\) vertices in \(k\)-connected graphs (Q792340) (← links)
• A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs (Q868356) (← links)
• A look at cycles containing specified elements of a graph (Q1045026) (← links)
• One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture (Q1850574) (← links)
• Rooted topological minors on four vertices (Q2099413) (← links)
• Cycle traversability for claw-free graphs and polyhedral maps (Q2216923) (← links)
• An Improved Algorithm for Finding Cycles Through Elements (Q3503860) (← links)
• Cycles intersecting a prescribed vertex set (Q3984472) (← links)