A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian

Gregory Gutin; J. Bang-Jensen; J. Huang

doi:10.1016/0012-365X(95)00272-X

A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian

Gregory Gutin, J. Bang-Jensen, J. Huang

Department of Computer Science

Research output: Contribution to journal › Article

43 Downloads (Pure)

Original language	English
Pages (from-to)	1-12
Journal	Discrete Mathematics
Volume	161
DOIs	https://doi.org/10.1016/0012-365X(95)00272-X
Publication status	Published - 1996

Keywords

multipartite tournament
k-partite
graph
digraph
vertex disjoint cycles
Hamiltonian
longest cycle

Access to Document

10.1016/0012-365X(95)00272-X

Full Text

http://www.sciencedirect.com/science/journal/0012365X

Cite this

@article{61da24c990fc49069dadeb52a383f03c,

title = "A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian",

keywords = "multipartite tournament, k-partite, graph, digraph, vertex disjoint cycles, Hamiltonian, longest cycle",

author = "Gregory Gutin and J. Bang-Jensen and J. Huang",

year = "1996",

doi = "10.1016/0012-365X(95)00272-X",

language = "English",

volume = "161",

pages = "1--12",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian

AU - Gutin, Gregory

AU - Bang-Jensen, J.

AU - Huang, J.

PY - 1996

Y1 - 1996

KW - multipartite tournament

KW - k-partite

KW - graph

KW - digraph

KW - vertex disjoint cycles

KW - Hamiltonian

KW - longest cycle

U2 - 10.1016/0012-365X(95)00272-X

DO - 10.1016/0012-365X(95)00272-X

M3 - Article

SN - 0012-365X

VL - 161

SP - 1

EP - 12

JO - Discrete Mathematics

JF - Discrete Mathematics

ER -