scientific article; zbMATH DE number 4047757

MaRDI QIDQ3784096zbMATH OpenFDO

Authors G. M. Gutin

Publication date 1987

zbMATH Keywords

complete bipartite graphlargest contourpolynomial algorithm

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35)

Recommendations

• Finding a Longest Path in a Complete Multipartite Digraph
• scientific article; zbMATH DE number 6007715
• scientific article; zbMATH DE number 3979087
• scientific article; zbMATH DE number 4101227
• Finding bipartite subgraphs efficiently

Cited in

(4)

• On a cyclic connectivity property of directed graphs
• Semicomplete Multipartite Digraphs
• scientific article; zbMATH DE number 4101227 (Why is no real title available?)
• Generalized paths and cycles in semicomplete multipartite 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 Q3784096)