Weakly quasi-Hamiltonian-set-connected multipartite tournaments

DOI10.1016/j.dam.2012.02.012zbMath1243.05140OpenAlexW3023598220MaRDI QIDQ427900

Yubao Guo, Michel Surmacs, Mei Lu

Publication date: 18 June 2012

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

Full work available at URL: https://doi.org/10.1016/j.dam.2012.02.012

zbMATH Keywords

multipartite tournamentquasi-Hamiltonian-connectivityweak quasi-Hamiltonian-set-connectivity

Mathematics Subject Classification ID

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

Related Items (5)

Competitively orientable complete multipartite graphs ⋮ Weakly quasi-Hamiltonian-connected multipartite tournaments ⋮ Quasi-hamiltonian paths in semicomplete multipartite digraphs ⋮ Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments ⋮ Quasi-Hamiltonian cycles in \(k\)-strong multipartite tournaments

Cites Work

• Unnamed Item
• Hamiltonian-connected tournaments
• Vertex deletion and cycles in multipartite tournaments
• Cycles in multipartite tournaments
• On Subtournaments of a Tournament

This page was built for publication: Weakly quasi-Hamiltonian-set-connected multipartite tournaments