Covering graphs with matchings of fixed size
| dc.citation.epage | 287 | en_US |
| dc.citation.issue | 2 | en_US |
| dc.citation.spage | 276 | en_US |
| dc.citation.volume | 310 | en_US |
| dc.contributor.author | Cariolaro, David | en_US |
| dc.contributor.author | Fu, Hung-Lin | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:18:00Z | |
| dc.date.available | 2014-12-08T15:18:00Z | |
| dc.date.issued | 2010-01-28 | en_US |
| dc.description.abstract | Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has size exactly m? If this happens, we say that G is [m]-coverable and we call M an [m]-covering of G. It is interesting to consider minimum [m]-coverings, i.e. [m]-coverings containing as few matchings as possible. Such [m]-coverings will be called excessive [m]-factolizations. The number of matchings in an excessive [m]-factorization is a graph parameter which will be called the excessive [m]-index and denoted by chi([m])'. In this paper we begin the study of this new parameter as well as of a number of other related graph parameters. (C) 2008 Elsevier B.V. All rights reserved. | en_US |
| dc.identifier.doi | 10.1016/j.disc.2008.09.031 | en_US |
| dc.identifier.issn | 0012-365X | en_US |
| dc.identifier.journal | DISCRETE MATHEMATICS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1016/j.disc.2008.09.031 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/13011 | |
| dc.identifier.wosnumber | WOS:000273169900010 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Excessive [m]-factorization | en_US |
| dc.subject | Excessive [m]-index | en_US |
| dc.subject | [m]-covering | en_US |
| dc.title | Covering graphs with matchings of fixed size | en_US |
| dc.type | Article; Proceedings Paper | en_US |