Pages that link to "Item:Q868356"

The following pages link to A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs (Q868356):

Displaying 12 items.

• Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs (Q709323) (← links)
• Cycles through \(k+2\) vertices in \(k\)-connected graphs (Q792340) (← links)
• A Chvátal--Erdős type condition for pancyclability (Q878642) (← links)
• Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs (Q1199122) (← links)
• An extension of a theorem on cycles containing specified independent edges (Q1348118) (← links)
• Cycles through a prescribed vertex set in \(n\)-connected graphs. (Q1426102) (← links)
• A generalization of a theorem of Dirac (Q1850552) (← links)
• On some cyclic connectivity properties of directed graphs (examples and problems) (Q2714234) (← links)
• On the cycle polytope of a directed graph and its relaxations (Q3057102) (← links)
• (Q3108620) (← links)
• Cycles passing throughk + 1 vertices ink-connected graphs (Q3506318) (← links)
• The Parameterized Complexity of Graph Cyclability (Q5891809) (← links)