scientific article; zbMATH DE number 867679

MaRDI QIDQ4873791zbMATH OpenFDO

Authors Jørgen Bang-Jensen

Publication date 21 April 1996

zbMATH Keywords

2-path problem for semicomplete digraphsalgorithmcharacterizationdecision problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4085689
• A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
• scientific article; zbMATH DE number 1463410
• The 2-disjoint path problem for circulant digraphs
• On the pathwidth of almost semicomplete digraphs
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• Disjoint paths in graphs. II: A special case
• The even-path problem for graphs and digraphs
• A note concerning paths and independence number in digraphs
• Decomposing semi-complete multigraphs and directed graphs into paths of length two

Cited in

(5)

• Edge-disjoint in- and out-branchings in tournaments and related path problems
• Linkages in locally semicomplete digraphs and quasi-transitive digraphs
• scientific article; zbMATH DE number 4085689 (Why is no real title available?)
• A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
• Digraphs with the path‐merging property

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