The following pages link to Extending cycles in directed graphs (Q580359):
Displaying 19 items.
- Cycle extendability in graphs and digraphs (Q550650) (← links)
- Extending cycles in graphs (Q750461) (← links)
- \(c\)-pancyclic partial ordering and \((c-1)\)-pan-outpath partial ordering in semicomplete multipartite digraphs. (Q1421090) (← links)
- Pancyclic orderings of in-tournaments (Q1613377) (← links)
- Degree conditions and cycle extendability (Q1894763) (← links)
- Regular tournaments with minimum split domination number and cycle extendability (Q2089539) (← links)
- Connectivity and extendability in digraphs (Q2089552) (← links)
- Cycle extendability in extended tournaments (Q2149595) (← links)
- Vertex pancyclic in-tournaments (Q2707976) (← links)
- Pancyclic orderings of in-tournaments (Q2741368) (← links)
- Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)
- (Q3166118) (← links)
- An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’ (Q3710537) (← links)
- (Q4863513) (← links)
- Cycle Extendability of Hamiltonian Strongly Chordal Graphs (Q4959662) (← links)
- Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in‐tournaments (Q5189241) (← links)
- Extremal and Degree Conditions for Path Extendability in Digraphs (Q5357959) (← links)
- (Q5501241) (← links)
- Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments (Q6055389) (← links)