A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian

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

Research output: Contribution to journalArticle

32 Downloads (Pure)
Original languageEnglish
Pages (from-to)1-12
JournalDiscrete Mathematics
Volume161
DOIs
Publication statusPublished - 1996

Keywords

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

Cite this