✦ LIBER ✦

On some factor theorems of graphs

✍ Scribed by Mao-cheng Cai

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 362 KB
Volume: 98
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90378-f

No coin nor oath required. For personal study only.

✦ Synopsis

The aim of this note is to show that some recently published results on graph factors derive fairly easily from Lovrisz' (g,f)-factor theorems.

📜 SIMILAR VOLUMES

Some theorems on graphs and posets

✍ William T. Trotter Jr.; John I. Moore Jr. 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 800 KB

In this journal, Lcclerc proved that the dimension of the partiailly ordered slet consisting of all subf~ce'~ of a tree T, m&red by inclusion, is the number of end yuints of 'I'. Leclerc posed the probkrn of determitAng the dimension the partially ed set P consisting of all inducxxI connected subgra

Some theorems of uniquely pancyclic grap

Some theorems of uniquely pancyclic graphs

✍ Yongbing Shi 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 773 KB

Some results on odd factors of graphs

✍ Cui Yuting; Mikio Kano 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 1 views

Some remarks about factors of graphs

✍ José R. Correa; Martín Matamala 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB

## Abstract A (__g__, __f__)‐factor of a graph is a subset __F__ of __E__ such that for all $v \in V$, $g(v)\le {\rm deg}\_{F}(v)\le f(v)$. Lovasz gave a necessary and sufficient condition for the existence of a (__g__, __f__)‐factor. We extend, to the case of edge‐weighted graphs, a result of Kano

The divisibility theorem for isomorphic

The divisibility theorem for isomorphic factorizations of complete graphs

✍ Frank Harary; Robert W. Robinson; Nicholas C. Wormald 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB

Factorizations of 4-Regular Graphs and P

Factorizations of 4-Regular Graphs and Petersen′s Theorem

✍ M. Kouider; G. Sabidussi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 513 KB

On the basis of the observation that a 3-regular graph has a perfect matching if and only if its line graph has a triangle-free 2 -factorisation, we show that a connected 4-regular graph has a triangle-free 2 -factorisation, provided it has no more than two cut-vertices belonging to a triangle. This