On the 1-factors of n-connected graphs

Joseph Zaks

doi:10.1016/0095-8956(71)90027-X

On the 1-factors of n-connected graphs

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

Abstract

L. W. Beineke and M. D. Plummer have recently proved [1] that every n-connected graph with a 1-factor has at least n different 1-factors. The main purpose of this paper is to prove that every n-connected graph with a 1-factor has at least as many as n(n - 2)(n - 4) ... 4 · 2, (or: n(n - 2)(n - 4) ... 5 · 3) 1-factors. The main lemma used is: if a 2-connected graph G has a 1-factor, then G contains a vertex V (and even two such vertices), such that each edge of G, incident to V, belongs to some 1-factor of G.

Original language	English
Pages (from-to)	169-180
Number of pages	12
Journal	Journal of Combinatorial Theory. Series B
Volume	11
Issue number	2
DOIs	https://doi.org/10.1016/0095-8956(71)90027-X
State	Published - Oct 1971
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/0095-8956(71)90027-X

Cite this

@article{933927bee5264deb92629f5cfd3e78b4,

title = "On the 1-factors of n-connected graphs",

abstract = "L. W. Beineke and M. D. Plummer have recently proved [1] that every n-connected graph with a 1-factor has at least n different 1-factors. The main purpose of this paper is to prove that every n-connected graph with a 1-factor has at least as many as n(n - 2)(n - 4) ... 4 · 2, (or: n(n - 2)(n - 4) ... 5 · 3) 1-factors. The main lemma used is: if a 2-connected graph G has a 1-factor, then G contains a vertex V (and even two such vertices), such that each edge of G, incident to V, belongs to some 1-factor of G.",

author = "Joseph Zaks",

year = "1971",

month = oct,

doi = "10.1016/0095-8956(71)90027-X",

language = "English",

volume = "11",

pages = "169--180",

journal = "Journal of Combinatorial Theory. Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - On the 1-factors of n-connected graphs

AU - Zaks, Joseph

PY - 1971/10

Y1 - 1971/10

N2 - L. W. Beineke and M. D. Plummer have recently proved [1] that every n-connected graph with a 1-factor has at least n different 1-factors. The main purpose of this paper is to prove that every n-connected graph with a 1-factor has at least as many as n(n - 2)(n - 4) ... 4 · 2, (or: n(n - 2)(n - 4) ... 5 · 3) 1-factors. The main lemma used is: if a 2-connected graph G has a 1-factor, then G contains a vertex V (and even two such vertices), such that each edge of G, incident to V, belongs to some 1-factor of G.

AB - L. W. Beineke and M. D. Plummer have recently proved [1] that every n-connected graph with a 1-factor has at least n different 1-factors. The main purpose of this paper is to prove that every n-connected graph with a 1-factor has at least as many as n(n - 2)(n - 4) ... 4 · 2, (or: n(n - 2)(n - 4) ... 5 · 3) 1-factors. The main lemma used is: if a 2-connected graph G has a 1-factor, then G contains a vertex V (and even two such vertices), such that each edge of G, incident to V, belongs to some 1-factor of G.

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

U2 - 10.1016/0095-8956(71)90027-X

DO - 10.1016/0095-8956(71)90027-X

M3 - Article

AN - SCOPUS:49649153422

SN - 0095-8956

VL - 11

SP - 169

EP - 180

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

IS - 2

ER -

On the 1-factors of n-connected graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this