An extremal connectivity parameter of tournaments

DOI10.1016/S0012-365X(00)00014-5zbMath0973.05036OpenAlexW2047328234WikidataQ127930519 ScholiaQ127930519MaRDI QIDQ1587602

Ľubomír Šoltés, William F. Klostermeyer

Publication date: 3 December 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00014-5

zbMATH Keywords

connectivitytournamentpush operation

Mathematics Subject Classification ID

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

Related Items

Pushing vertices in digraphs without long induced cycles ⋮ Decomposability index of tournaments