On minimum sets of 1-factors covering a complete multipartite graph

David Cariolaro*, Hung-Lin Fu

*Corresponding author for this work

Research output: Contribution to journalArticle

12 Scopus citations

Abstract

We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1-factors whose union is the whole graph and, when these conditions are satisfied, we determine the minimum Size of Such a Set.

Original languageEnglish
Pages (from-to)239-250
Number of pages12
JournalJournal of Graph Theory
Volume58
Issue number3
DOIs
StatePublished - 1 Jul 2008

Keywords

  • 1-factor
  • 1-factor cover
  • Complete multipartite graph
  • Excessive factorization
  • Excessive index

Fingerprint Dive into the research topics of 'On minimum sets of 1-factors covering a complete multipartite graph'. Together they form a unique fingerprint.

  • Cite this