Strongly 4-path-connectivity in almost regular multipartite tournaments

DOI10.1016/J.DISC.2007.03.048zbMATH Open1131.05047OpenAlexW2010766672MaRDI QIDQ2463909FDOQ2463909

Authors: Irene Stella, Lutz Volkmann, Stefan Winzen 

Publication date: 6 December 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.048

Recommendations

• On the connectivity of close to regular multipartite tournaments
• scientific article; zbMATH DE number 2197943
• Almost regular multipartite tournaments containing a Hamiltonian path through a given arc
• Strong subtournaments containing a given vertex in regular multipartite tournaments
• Cycles through a given arc and certain partite sets in almost regular multipartite tournaments

zbMATH Keywords

almost regular digraphsstrongly \(k\)-path-connected

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Hamiltonian-connected tournaments
• Cycles in multipartite tournaments: Results and problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic
• Cycles of Each Length in Regular Tournaments
• How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
• Bypasses in asymmetric digraphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Multipartite tournaments: a survey
• On the connectivity of close to regular multipartite tournaments

This page was built for publication: Strongly 4-path-connectivity in almost regular multipartite tournaments

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