Cycles of given length in oriented graphs

DOI10.1016/j.jctb.2009.08.002zbMath1274.05257arXiv0806.0933OpenAlexW2082236154MaRDI QIDQ965252

Deryk Osthus, Daniela Kühn, Luke J. Kelly

Publication date: 21 April 2010

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

Full work available at URL: https://arxiv.org/abs/0806.0933

zbMATH Keywords

digraphsoriented graphsshort cyclessemidegree

Mathematics Subject Classification ID

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

Related Items (4)

Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs ⋮ A survey on Hamilton cycles in directed graphs ⋮ Hamiltonian degree sequences in digraphs ⋮ Short cycles in oriented graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Short cycles in directed graphs
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• On directed triangles in digraphs
• Short cycles in digraphs
• Directed triangles in digraphs
• An Ore-type condition implying a digraph to be pancyclic
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• On pancyclic digraphs
• On the Caccetta-Häggkvist conjecture
• On the girth of digraphs
• A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
• An exact minimum degree condition for Hamilton cycles in oriented graphs
• Embedding large subgraphs into dense graphs
• Pancyclic oriented graphs
• On minimal regular digraphs with given girth
• Testing subgraphs in directed graphs

This page was built for publication: Cycles of given length in oriented graphs