Excessive near 1-factorizations

David Cariolaro; Hung-Lin Fu

doi:10.1016/j.disc.2008.05.035

Excessive near 1-factorizations

David Cariolaro^*, Hung-Lin Fu

^*Corresponding author for this work

Department of Applied Mathematics

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Abstract

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 minimum number of near 1-factors in such sets.

Original language	English
Pages (from-to)	4690-4696
Number of pages	7
Journal	Discrete Mathematics
Volume	309
Issue number	14
DOIs	https://doi.org/10.1016/j.disc.2008.05.035
State	Published - 28 Jul 2009

Keywords

Excessive index
Excessive near 1-factorization
Near 1-factor
Near 1-factorization

Access to Document

10.1016/j.disc.2008.05.035

Fingerprint Dive into the research topics of 'Excessive near 1-factorizations'. Together they form a unique fingerprint.

Cite this

@article{79ae92bc2ef24b468a328a630f12d282,

title = "Excessive near 1-factorizations",

abstract = "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 minimum number of near 1-factors in such sets.",

keywords = "Excessive index, Excessive near 1-factorization, Near 1-factor, Near 1-factorization",

author = "David Cariolaro and Hung-Lin Fu",

year = "2009",

month = jul,

day = "28",

doi = "10.1016/j.disc.2008.05.035",

language = "English",

volume = "309",

pages = "4690--4696",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "14",

}

TY - JOUR

T1 - Excessive near 1-factorizations

AU - Cariolaro, David

AU - Fu, Hung-Lin

PY - 2009/7/28

Y1 - 2009/7/28

N2 - 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 minimum number of near 1-factors in such sets.

AB - 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 minimum number of near 1-factors in such sets.

KW - Excessive index

KW - Excessive near 1-factorization

KW - Near 1-factor

KW - Near 1-factorization

UR - http://www.scopus.com/inward/record.url?scp=67249140621&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2008.05.035

DO - 10.1016/j.disc.2008.05.035

M3 - Article

AN - SCOPUS:67249140621

VL - 309

SP - 4690

EP - 4696

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 14

ER -

Excessive near 1-factorizations

Abstract

Keywords

Access to Document

Other files and links

Cite this