標題: Excessive near 1-factorizations
作者: Cariolaro, David
Fu, Hung-Lin
應用數學系
Department of Applied Mathematics
關鍵字: Near 1-factor;Near 1-factorization;Excessive near 1-factorization;Excessive index
公開日期: 28-Jul-2009
摘要: We begin the study of sets of near 1-factors of graphs G of odd order whose union contains all the edges of G and determine, for a few classes of graphs, the mini mum number of near 1-factors in such sets. (C) 2008 Elsevier B.V. All rights reserved.
URI: http://dx.doi.org/10.1016/j.disc.2008.05.035
http://hdl.handle.net/11536/6936
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.05.035
期刊: DISCRETE MATHEMATICS
Volume: 309
Issue: 14
起始頁: 4690
結束頁: 4696
Appears in Collections:Articles


Files in This Item:

  1. 000267632300004.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.