Covering graphs with matchings of fixed size
type: Item
instance of: scholarly article
title: Covering graphs with matchings of fixed size
zbMATH Open document ID: 1243.05192
author: D. Cariolaro
author: Hung-Lin Fu
published in: Discrete Mathematics
publication date: 2010-03-29T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5687557
zbMATH Keywords: excessive \([m]\)-factorization
zbMATH Keywords: excessive \([m]\)-index
zbMATH Keywords: \([m]\)-covering
MaRDI profile type: Publication
full work available at URL: j.disc.2008.09.031
OpenAlex ID: W2021614430
cites work: Q3424771
cites work: On minimum sets of 1-factors covering a complete multipartite graph
cites work: Paths, Trees, and Flowers
cites work: Q5604409
cites work: Matching theory
cites work: The Solution of a Timetabling Problem
cites work: Q5650698
DOI: 10.1016/J.DISC.2008.09.031
description: scientific article; zbMATH DE number 5687557