Pancyclic orderings of in-tournaments

DOI10.1016/S0166-218X(01)00293-1zbMath1002.05033OpenAlexW2177033363MaRDI QIDQ1613377

Meike Tewes

Publication date: 29 August 2002

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00293-1

zbMATH Keywords

digraphHamiltonianbound

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Vertex 6-pancyclic in-tournaments ⋮ All 2-connected in-tournaments that are cycle complementary ⋮ Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in‐tournaments ⋮ Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments ⋮ Locally Semicomplete Digraphs and Generalizations

Cites Work

• Extending cycles in directed graphs
• Extending cycles in graphs
• In-tournament digraphs
• Vertex pancyclic in-tournaments
• On Subtournaments of a Tournament
• Pancyclic in-tournaments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pancyclic orderings of in-tournaments