1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorCariolaro, Daviden_US
dc.contributor.authorFu, Hung-Linen_US
dc.date.accessioned2014-12-08T15:09:06Z-
dc.date.available2014-12-08T15:09:06Z-
dc.date.issued2009-07-28en_US
dc.identifier.issn0012-365Xen_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.disc.2008.05.035en_US
dc.identifier.urihttp://hdl.handle.net/11536/6936-
dc.description.abstractWe 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.en_US
dc.language.isoen_USen_US
dc.subjectNear 1-factoren_US
dc.subjectNear 1-factorizationen_US
dc.subjectExcessive near 1-factorizationen_US
dc.subjectExcessive indexen_US
dc.titleExcessive near 1-factorizationsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.disc.2008.05.035en_US
dc.identifier.journalDISCRETE MATHEMATICSen_US
dc.citation.volume309en_US
dc.citation.issue14en_US
dc.citation.spage4690en_US
dc.citation.epage4696en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000267632300004-
dc.citation.woscount3-
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.

Related Contents
Loading...