✦ LIBER ✦

Degree Sequences and the Existence ofk-Factors

✍ Scribed by D. Bauer; H. J. Broersma; J. van den Heuvel; N. Kahl; E. Schmeichel

Book ID: 106047979
Publisher: Springer Japan
Year: 2011
Tongue: English
Weight: 289 KB
Volume: 28
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-011-1044-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum degree of bipartite graphs and t

Minimum degree of bipartite graphs and the existence ofk-factors

✍ P. Katerinis 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 250 KB

Minimum degree of a graph and the existe

Minimum degree of a graph and the existence ofk-factors

✍ Katerinis, P 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 159 KB

Toughness and the existence ofk-factors.

Toughness and the existence ofk-factors. II

✍ Hikoe Enomoto 📂 Article 📅 1986 🏛 Springer Japan 🌐 English ⚖ 257 KB

Signed graph factors and degree sequence

Signed graph factors and degree sequences

✍ Dean Hoffman; Heather Jordon 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

## Abstract For a signed graph __G__ and function $f: V(G) \rightarrow Z$, a signed __f__‐factor of __G__ is a spanning subgraph __F__ such that sdeg~__F__~(__υ__) = __f__(__υ__) for every vertex __υ__ of __G__, where sdeg(__υ__) is the number of positive edges incident with __v__ less the number o

An ore-type condition for the existence

An ore-type condition for the existence ofk-factors in graphs

✍ Tadashi Iida; Tsuyoshi Nishimura 📂 Article 📅 1991 🏛 Springer Japan 🌐 English ⚖ 431 KB

Toughness, minimum degree, and the exist

Toughness, minimum degree, and the existence of 2-factors

✍ D. Bauer; E. Schmeichel 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 690 KB

## Abstract Degree conditions on the vertices of a __t__‐tough graph __G__(1 ≦ __t__ ≦ 2) that ensure the existence of a 2‐factor in __G__ are presented. These conditions are asymptotically best possible for every __t__ ϵ [1, 3/2] and for infinitely many __t__ ϵ [3/2, 2].