Covering graphs with matchings of fixed size

David Cariolaro*, Hung-Lin Fu

*此作品的通信作者

研究成果: Article同行評審

6 引文 斯高帕斯(Scopus)

摘要

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] -factorizations. The number of matchings in an excessive [m]-factorization is a graph parameter which will be called the excessive[m] -index and denoted by χ[m]. In this paper we begin the study of this new parameter as well as of a number of other related graph parameters.

原文English
頁(從 - 到)276-287
頁數12
期刊Discrete Mathematics
310
發行號2
DOIs
出版狀態Published - 28 一月 2010

指紋

深入研究「Covering graphs with matchings of fixed size」主題。共同形成了獨特的指紋。

引用此