scientific article; zbMATH DE number 4103112

MaRDI QIDQ3828034zbMATH OpenFDO

Authors G. M. Gutin

Publication date 1988

zbMATH Keywords

Hamiltonian path

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Cited in

(12)

• A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
• Hamiltonian paths containing a given arc, in almost regular bipartite tournaments
• Independent sets and non-augmentable paths in generalizations of tournaments
• Paths with a given number of vertices from each partite set in regular multipartite tournaments
• Multipartite tournaments: a survey
• Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs
• Longest path partitions in generalizations of tournaments
• Basic Terminology, Notation and Results
• Semicomplete Multipartite Digraphs
• CHARACTER GRAPHS WITH NONBIPARTITE HAMILTONIAN COMPLEMENT
• Generalized paths and cycles in semicomplete multipartite digraphs
• Minimum cycle factors in 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 Q3828034)