Completely strong path-connected tournaments

DOI10.1016/0095-8956(82)90066-1MaRDI QIDQ1165863zbMATH OpenOpenAlexFDO

Authors Keming Zhang

Publication date 1982

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(82)90066-1

zbMATH Keywords

2-connected tournamentcompletely strong path-connected

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Cites work

• Bypasses in asymmetric digraphs
• Cycles of each length in tournaments
• Graph theory with applications
• Hamiltonian-connected tournaments
• The square of a block is strongly path connected

Cited in

(4)

• Path-connectivity in local tournaments
• On \(d\)-panconnected tournaments with large semidegrees
• Extremal and degree conditions for path extendability in digraphs
• Bypaths in tournaments

This page was built for publication: Completely strong path-connected tournaments

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