Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in‐tournaments

DOI10.1002/jgt.20408zbMath1200.05094OpenAlexW4242784566WikidataQ123328749 ScholiaQ123328749MaRDI QIDQ5189241

Dirk Meierling

Publication date: 15 March 2010

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20408

zbMATH Keywords

in-tournamentsextendable cycles

Mathematics Subject Classification ID

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

Related Items (3)

Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments ⋮ Extremal and Degree Conditions for Path Extendability in Digraphs ⋮ Locally Semicomplete Digraphs and Generalizations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• In-tournament digraphs
• Pancyclic orderings of in-tournaments
• Vertex 6-pancyclic in-tournaments
• All 2-connected in-tournaments that are cycle complementary
• Vertex pancyclic in-tournaments
• Locally semicomplete digraphs: A generalization of tournaments
• Generalizations of tournaments: A survey
• Pancyclic in-tournaments

This page was built for publication: Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in‐tournaments