Trail-connected tournaments

DOI10.1016/J.AMC.2020.125595MaRDI QIDQ2660372zbMATH OpenOpenAlexFDO

Authors Juan Liu, Qinghai Liu, Xindong Zhang, Xing Chen

Publication date 30 March 2021

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2020.125595

zbMATH Keywords

digraphsHamiltonian-connected graphtournamenttrail-connected graph

Mathematics Subject Classification ID

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

Recommendations

• On the spanning connectivity of tournaments
• On arc-traceable tournaments
• Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments
• Weakly Hamiltonian-connected locally semicomplete digraphs
• Spanning 2-strong tournaments in 3-strong semicomplete digraphs

Cites work

• Cycles in digraphs– a survey
• Digraphs
• Graph theory
• Hamiltonian-connected tournaments
• scientific article; zbMATH DE number 3150485 (Why is no real title available?)
• Strongly Hamiltonian-connected locally semicomplete digraphs
• Weakly Hamiltonian-connected locally semicomplete digraphs
• Weakly Hamiltonian-connected ordinary multipartite tournaments

Cited in

(5)

• On the spanning connectivity of tournaments
• On arc-traceable tournaments
• Spanning Eulerian subdigraphs in jump digraphs
• Spanning eulerian subdigraphs in semicomplete digraphs
• Trails, paths and cycles of digraphs with _2-stable number 2

This page was built for publication: Trail-connected tournaments

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