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

  1. David Cariolaro1,
  2. Hung-Lin Fu2

Article first published online: 15 APR 2008

DOI: 10.1002/jgt.20303

Issue

Journal of Graph Theory

Journal of Graph Theory

Volume 58, Issue 3, pages 239–250, July 2008

Additional Information

How to Cite

Cariolaro, D. and Fu, H.-L. (2008), On minimum sets of 1-factors covering a complete multipartite graph. Journal of Graph Theory, 58: 239–250. doi: 10.1002/jgt.20303

Author Information

  1. 1

    Institute of Mathematics, Academia Sinica, Nankang, Taipei 11529, Taiwan

  2. 2

    Department of Applied Mathematics, National Chiao Tung University, Hsin Chu 30050, Taiwan

Publication History

  1. Issue published online: 14 MAY 2008
  2. Article first published online: 15 APR 2008
  3. Manuscript Revised: 21 JAN 2008
  4. Manuscript Received: 20 APR 2006

SEARCH

SEARCH BY CITATION

ARTICLE TOOLS

Get PDF (132K)

Keywords:

  • 1–factor;
  • 1–factor cover;
  • excessive factorization;
  • excessive index;
  • complete multipartite graph

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. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:239-250, 2008

Get PDF (132K)