scientific article; zbMATH DE number 3869359
From MaRDI portal
Publication:3337490
Recommendations
Cited in
(20)- Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs
- On the structure of locally semicomplete digraphs
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs
- An improved linear connectivity bound for tournaments to be highly linked
- (2k+1)-connected tournaments with large minimum out-degree are k-linked
- Every (13k - 6)-strong tournament with minimum out-degree at least 28k - 13 is k-linked
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
- On 1-factors with prescribed lengths in tournaments
- A note on min-max pair in tournaments
- Highly linked tournaments with large minimum out-degree
- Improved results on linkage problems
- Tournaments and Semicomplete Digraphs
- scientific article; zbMATH DE number 3914346 (Why is no real title available?)
- scientific article; zbMATH DE number 944224 (Why is no real title available?)
- Highly linked tournaments
- Strong arc decompositions of split digraphs
- Counterexamples to the linkage conjecture for tournaments
- On the k-linkage problem for generalizations of semicomplete digraphs
- A new connectivity bound for a tournament to be highly linked
- Tournament pathwidth and topological containment
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337490)
