The following pages link to Long Cycles in Digraphs (Q3901539):
Displayed 27 items.
- On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li (Q516779) (← links)
- A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs (Q803164) (← links)
- \(k\)-linked and \(k\)-cyclic digraphs (Q917574) (← links)
- Recognizing tough graphs is NP-hard (Q918697) (← links)
- Cycles and paths of many lengths in bipartite digraphs (Q923098) (← links)
- Triangle packings and 1-factors in oriented graphs (Q1026012) (← links)
- A Chvátal-Erdős condition for (1,1)-factors in digraphs (Q1071779) (← links)
- A sufficient condition for oriented graphs to be Hamiltonian (Q1079579) (← links)
- A Chvátal-Erdős condition for Hamilton cycles in digraphs (Q1095153) (← links)
- Bounds of the longest directed cycle length for minimal strong digraphs (Q1106239) (← links)
- On the complexity of recognizing tough graphs (Q1313820) (← links)
- The complexity of recognizing tough cubic graphs (Q1372728) (← links)
- Locally dense supereulerian digraphs (Q1701108) (← links)
- Sufficient conditions for a balanced bipartite digraph to be even pancyclic (Q1701114) (← links)
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs (Q1732099) (← links)
- On degree sum conditions for directed path-factors with a specified number of paths (Q2005702) (← links)
- Degree condition for a digraph to be supereulerian (Q2062894) (← links)
- Matching and spanning trails in digraphs (Q2231788) (← links)
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey (Q2277468) (← links)
- Supereulerian 3-path-quasi-transitive digraphs (Q2287800) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Supereulerian Digraphs with Large Arc-Strong Connectivity (Q2800596) (← links)
- A Dirac-Type Result on Hamilton Cycles in Oriented Graphs (Q3529511) (← links)
- Cycles in digraphs– a survey (Q3907591) (← links)
- Hamilton Cycles in Oriented Graphs (Q4289304) (← links)
- Sufficient Conditions for a Digraph to be Supereulerian (Q5251197) (← links)
- (Q5708558) (← links)
