scientific article; zbMATH DE number 4085689

MaRDI QIDQ3815328zbMATH OpenFDO

Authors Jørgen Bang-Jensen

Publication date 1989

zbMATH Keywords

2-linkage problemsemicomplete digraphtournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Recommendations

• A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
• On digraphs with no two disjoint directed cycles
• Disjoint paths in decomposable digraphs
• The 2-linkage problem for acyclic digraphs
• scientific article; zbMATH DE number 867679

Cited in

(19)

• The 2-linkage problem for acyclic digraphs
• Edge-disjoint in- and out-branchings in tournaments and related path problems
• 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
• Every (13k - 6)-strong tournament with minimum out-degree at least 28k - 13 is k-linked
• Highly linked tournaments with large minimum out-degree
• Improved results on linkage problems
• Tournaments and Semicomplete Digraphs
• A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
• Links between two semisymmetric graphs on 112 vertices via association schemes
• Disjoint paths in tournaments
• scientific article; zbMATH DE number 867679 (Why is no real title available?)
• Highly linked tournaments
• Disjoint paths in decomposable digraphs
• Strong arc decompositions of split digraphs
• Counterexamples to the linkage conjecture for tournaments
• A new connectivity bound for a tournament to be highly linked
• Compositions of digraphs: a survey

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 Q3815328)