Cycles in \(k\)-traceable oriented graphs

DOI10.1016/j.disc.2011.05.032zbMath1234.05116OpenAlexW2016857938MaRDI QIDQ641171

Juan-Miguel Gracia

Publication date: 21 October 2011

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.05.032

zbMATH Keywords

oriented graphtournament\(k\)-traceablepath partition conjecturepancyclic digraphtraceability conjecture

Mathematics Subject Classification ID

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

Related Items (4)

Every 8-traceable oriented graph is traceable ⋮ Computational results on the traceability of oriented graphs of small order ⋮ Forbidden subdigraphs conditions on the traceability conjecture ⋮ A linear bound towards the traceability conjecture

Cites Work

• The path partition conjecture is true for claw-free graphs
• Traceability of \(k\)-traceable oriented graphs
• A traceability conjecture for oriented graphs
• In-tournament digraphs
• Longest path partitions in generalizations of tournaments
• When the cartesian product of two directed cycles is hypo-Hamiltonian
• The directed path partition conjecture
• On Subtournaments of a Tournament
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cycles in \(k\)-traceable oriented graphs