Completely strong path-connected tournaments

DOI10.1016/0095-8956(82)90066-1zbMath0488.05038OpenAlexW2045455130MaRDI QIDQ1165863

Ke Min 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

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

Related Items (4)

On \(d\)-panconnected tournaments with large semidegrees ⋮ Path-connectivity in local tournaments ⋮ Bypaths in tournaments ⋮ Extremal and Degree Conditions for Path Extendability in Digraphs

Cites Work

• Unnamed Item
• Hamiltonian-connected tournaments
• Cycles of each length in tournaments
• The square of a block is strongly path connected
• Bypasses in asymmetric digraphs

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