scientific article; zbMATH DE number 3979087

MaRDI QIDQ3744182zbMATH OpenFDO

Authors G. M. Gutin

Publication date 1985

zbMATH Keywords

complete bipartite digraphscomplete bipartite graphhamiltonian path

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4177106
• Finding a Longest Path in a Complete Multipartite Digraph
• Hamiltonian Properties of Bipartite Graphs and Digraphs with Bipartite Independence 2
• Weakly hamiltonian-connected vertices in bipartite tournaments
• scientific article; zbMATH DE number 16382

Cited in

(9)

• A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
• An algorithmic characterization of total digraphs
• scientific article; zbMATH DE number 4047757 (Why is no real title available?)
• Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor
• scientific article; zbMATH DE number 16382 (Why is no real title available?)
• Finding a Longest Path in a Complete Multipartite Digraph
• 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 Q3744182)