scientific article; zbMATH DE number 3869359

MaRDI QIDQ3337490zbMATH OpenFDO

Authors Carsten Thomassen

Publication date 1984

zbMATH Keywords

tournamentspath lengthlarge connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 3914346
• scientific article; zbMATH DE number 4089591
• On \(d\)-panconnected tournaments with large semidegrees
• An extremal connectivity parameter of tournaments
• A note on min-max pair in tournaments

Cited in

(17)

• Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
• Every \((13k - 6)\)-strong tournament with minimum out-degree at least \(28k - 13\) is \(k\)-linked
• Highly linked tournaments
• scientific article; zbMATH DE number 3914346 (Why is no real title available?)
• Highly linked tournaments with large minimum out-degree
• Tournaments and Semicomplete Digraphs
• A note on min-max pair in tournaments
• Tournament pathwidth and topological containment
• An improved linear connectivity bound for tournaments to be highly linked
• Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs
• On the structure of locally semicomplete digraphs
• scientific article; zbMATH DE number 944224 (Why is no real title available?)
• Strong arc decompositions of split digraphs
• On 1-factors with prescribed lengths in tournaments
• Improved results on linkage problems
• \((2k+1)\)-connected tournaments with large minimum out-degree are \(k\)-linked
• Linkages in locally semicomplete digraphs and quasi-transitive digraphs

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)