An Ore-type condition implying a digraph to be pancyclic

DOI10.1016/0012-365X(77)90122-4zbMath0361.05034MaRDI QIDQ1239327

Carsten Thomassen

Publication date: 1977

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items

Vertex-pancyclism in the generalized sum of digraphs ⋮ A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs ⋮ A survey on Hamilton cycles in directed graphs ⋮ Sufficient conditions for a balanced bipartite digraph to be even pancyclic ⋮ Cycles and paths of many lengths in bipartite digraphs ⋮ On dominating pair degree conditions for Hamiltonicity in balanced bipartite digraphs ⋮ Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs ⋮ On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li ⋮ Cycles of given length in oriented graphs ⋮ Hamiltonian degree sequences in digraphs ⋮ Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey ⋮ New sufficient conditions for bipancyclicity of balanced bipartite digraphs ⋮ Short cycles in oriented graphs ⋮ Pancyclism and Meyniel's conditions

Cites Work

• Unnamed Item
• Hamiltonian paths in oriented graphs
• A short proof of Meyniel's theorem
• A theorem on pancyclic-oriented graphs
• Parallel concepts in graph theory
• On pancyclic digraphs
• Pancyclic graphs. I
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• Note on Hamilton Circuits
• Sufficient Conditions for Circuits in Graphs^†
• Some Theorems on Abstract Graphs