Long Cycles in Digraphs

Cited in

(32)

Triangle packings and 1-factors in oriented graphs
A Chvátal-Erdős condition for (1,1)-factors in digraphs
A sufficient condition for oriented graphs to be Hamiltonian
A Chvátal-Erdős condition for Hamilton cycles in digraphs
Bounds of the longest directed cycle length for minimal strong digraphs
On the complexity of recognizing tough graphs
The complexity of recognizing tough cubic graphs
Locally dense supereulerian digraphs
Sufficient conditions for a balanced bipartite digraph to be even pancyclic
Sufficient conditions for Hamiltonian cycles in bipartite digraphs
On degree sum conditions for directed path-factors with a specified number of paths
Degree condition for a digraph to be supereulerian
Matching and spanning trails in digraphs
Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
Supereulerian 3-path-quasi-transitive digraphs
Toughness in graphs -- a survey
Supereulerian digraphs with large arc-strong connectivity
A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
Cycles in digraphs– a survey
Hamilton Cycles in Oriented Graphs
On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
Sufficient conditions for a digraph to be supereulerian
scientific article; zbMATH DE number 2230266 (Why is no real title available?)
Cycle-factors in oriented graphs
A new sufficient condition for a 2-strong digraph to be Hamiltonian
Trails, paths and cycles of digraphs with _2-stable number 2
Supereulerian oriented graphs with large arc-strong connectivity
On three conjectures of Thomassen and the extremal digraphs for two conjectures of Nash-Williams
A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs
k-linked and k-cyclic digraphs
Recognizing tough graphs is NP-hard
Cycles and paths of many lengths in bipartite digraphs

This page was built for publication: Long Cycles in Digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3901539)