On pancyclic digraphs

DOI10.1016/0095-8956(76)90063-0zbMath0284.05110OpenAlexW2087159183MaRDI QIDQ1844685

Carsten Thomassen, Roland Haeggkvist

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(76)90063-0

Mathematics Subject Classification ID

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

Related Items

A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture, Packing and Covering a Given Directed Graph in a Directed Graph, Safe sets and in-dominating sets in digraphs, Sufficient conditions for a balanced bipartite digraph to be even pancyclic, Cycles in strong oriented graphs, Cycles and paths of many lengths in bipartite digraphs, Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On the structure of oriented graphs and digraphs with forbidden tournaments or cycles, On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li, Cycles of given length in oriented graphs, Algorithmic Solution of Extremal Digraph Problems, Graph theory (algorithmic, algebraic, and metric problems), An Ore-type condition implying a digraph to be pancyclic, Short cycles in oriented graphs, Number of arcs and cycles in digraphs, Pancyclism and Meyniel's conditions, Sign-nonsingular matrices and even cycles in directed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• Pancyclic graphs. I
• Large cycles in graphs
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• On the structure of linear graphs
• Sufficient Conditions for Circuits in Graphs^†