A theorem on pancyclic-oriented graphs

DOI10.1016/0095-8956(77)90028-4zbMath0395.05041OpenAlexW2092215833MaRDI QIDQ1252867

Maria Overbeck-Larisch

Publication date: 1977

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(77)90028-4

zbMATH Keywords

HamiltonianOriented GraphsPancyclicStrongly Connected GraphTournament

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Sufficient conditions for a balanced bipartite digraph to be even pancyclic ⋮ On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li ⋮ An Ore-type condition implying a digraph to be pancyclic ⋮ Pancyclism and Meyniel's conditions

Cites Work

• Hamiltonian paths in oriented graphs
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente

This page was built for publication: A theorem on pancyclic-oriented graphs