Cites work
- scientific article; zbMATH DE number 3149611 (Why is no real title available?)
- scientific article; zbMATH DE number 3333210 (Why is no real title available?)
- Large cycles in graphs
- On the structure of linear graphs
- Pancyclic graphs. I
- Parallel concepts in graph theory
- Sufficient Conditions for Circuits in Graphs†
- Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
Cited in
(20)- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Packing and Covering a Given Directed Graph in a Directed Graph
- Cycles and paths of many lengths in bipartite digraphs
- Safe sets and in-dominating sets in digraphs
- Cycles of given length in oriented graphs
- A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
- Algorithmic Solution of Extremal Digraph Problems
- An Ore-type condition implying a digraph to be pancyclic
- Sign-nonsingular matrices and even cycles in directed graphs
- Graph theory (algorithmic, algebraic, and metric problems)
- A new sufficient condition for a 2-strong digraph to be Hamiltonian
- Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs
- Cycles in strong oriented graphs
- Turán problems for oriented graphs
- Short cycles in oriented graphs
- Number of arcs and cycles in digraphs
- Sufficient conditions for a balanced bipartite digraph to be even pancyclic
- Pancyclism and Meyniel's conditions
- On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
- On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
This page was built for publication: On pancyclic digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1844685)
