scientific article; zbMATH DE number 3869359
From MaRDI portal
Publication:3337490
zbMATH Open0546.05030MaRDI QIDQ3337490FDOQ3337490
Authors: Carsten Thomassen
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
Cited In (18)
- A note on min-max pair in tournaments
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs
- Every \((13k - 6)\)-strong tournament with minimum out-degree at least \(28k - 13\) is \(k\)-linked
- Title not available (Why is that?)
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
- On the structure of locally semicomplete digraphs
- Tournament pathwidth and topological containment
- Bipartitions of highly connected tournaments
- Highly linked tournaments
- Strong arc decompositions of split digraphs
- Tournaments and Semicomplete Digraphs
- Title not available (Why is that?)
- \((2k+1)\)-connected tournaments with large minimum out-degree are \(k\)-linked
- On 1-factors with prescribed lengths in tournaments
- Highly linked tournaments with large minimum out-degree
- Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs
- Improved results on linkage problems
- An improved linear connectivity bound for tournaments to be highly linked
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)