Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
From MaRDI portal
Publication:6055389
DOI10.1002/jgt.22606zbMath1522.05171OpenAlexW3037033677MaRDI QIDQ6055389
Xiaoyan Zhang, Dingjun Lou, Gregory Gutin, Zan-Bo Zhang
Publication date: 29 September 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22606
Hamiltonicitymultipartite tournamentsbipartite tournamentspancyclicityvertex pancyclicityfull cycle extendability
Related Items (3)
Cycle extendability in extended tournaments ⋮ The weakly dimension-balanced pancyclicity on toroidal mesh graph \(T_{m,n}\) When both \(m\) and \(n\) are odd ⋮ Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter
Cites Work
- Unnamed Item
- Unnamed Item
- A survey on Hamilton cycles in directed graphs
- Extending cycles in directed graphs
- Cycles in bipartite tournaments
- Advances on the Hamiltonian problem -- a survey
- Cycles and paths in bipartite tournaments with spanning configurations
- Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
- Recent advances on the Hamiltonian problem: survey III
- Pancyclic graphs. I
- Vertex pancyclic in-tournaments
- Tournaments and Semicomplete Digraphs
- Semicomplete Multipartite Digraphs
- Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments
- Long paths and cycles in oriented graphs
- Updating the hamiltonian problem—A survey
- A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
- A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph
- Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in‐tournaments
- Hamiltonian Chordal Graphs are not Cycle Extendable
- Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs
- Extremal and Degree Conditions for Path Extendability in Digraphs
- The Theory of Round Robin Tournaments
- Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes
- Cycle Extendability of Hamiltonian Interval Graphs
- Some Theorems on Abstract Graphs
This page was built for publication: Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments