Edge-disjoint Hamiltonian cycles in hypertournaments

DOI10.1002/JGT.20120MaRDI QIDQ3376689zbMATH OpenOpenAlexWikidataFDO

Authors Vojislav Petrovic, Carsten Thomassen

Publication date 24 March 2006

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

Full work available at URL http://orbit.dtu.dk/en/publications/edgedisjoint-hamiltonian-cycles-in-hypertournaments(3ba948a7-d2cc-4f82-adec-ea82b5694439).html

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Vertex-pancyclicity of hypertournaments
• Edge disjoint Hamiltonian cycles in highly connected tournaments
• Hamiltonian paths and cycles in hypertournaments
• On pancyclic arcs in hypertournaments
• Pancyclic arcs in Hamiltonian cycles of hypertournaments

Cited in

(15)

• A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes
• Regular Hypertournaments and Arc-Pancyclicity
• Kings in hypertournaments
• Miscellaneous digraph classes
• Vertex-pancyclicity of hypertournaments
• Edge disjoint Hamilton cycles in graphs
• Edge disjoint Hamiltonian cycles in highly connected tournaments
• Kings in bipartite hypertournaments
• On pancyclic arcs in hypertournaments
• Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
• On the vertex-pancyclicity of hypertournaments
• The \(H\)-force set of a hypertournament
• Embedding three edge-disjoint Hamiltonian cycles into locally twisted cubes
• The (1, 2)-step competition graph of a hypertournament
• The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks

This page was built for publication: Edge-disjoint Hamiltonian cycles in hypertournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3376689)