✦ LIBER ✦

Binding numbers and f-factors of graphs

✍ Scribed by Mikio Kano; Norihide Tokushige

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 351 KB
Volume: 54
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90053-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The binding numbers of some Cartesian pr

The binding numbers of some Cartesian products of graphs

✍ Danuta Michalak 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 238 KB

In the paper we obtain some conditions under which the binding number bind (C) of a Cartesian product graph G is equal to The concept of the binding number of a graph was introduced by Woodall in 1973 . The main theorem of Woodall's paper is a sufficient condition for the existence of a Hamiltonian

Stability number and [a,b]-factors in gr

Stability number and [a,b]-factors in graphs

✍ Mekkia Kouider; Zbigniew Lonc 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

## Abstract A spanning subgraph whose vertices have degrees belonging to the interval [__a,b__], where __a__ and __b__ are positive integers, such that __a__ ≤ __b__, is called an [__a,b__]‐factor. In this paper, we prove sufficient conditions for existence of an [__a,b__]‐factor, a connected [__a,

Multichromatic numbers, star chromatic n

Multichromatic numbers, star chromatic numbers and Kneser graphs

✍ Johnson, A.; Holroyd, F. C.; Stahl, S. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

We investigate the relation between the multichromatic number (discussed by Stahl and by Hilton, Rado and Scott) and the star chromatic number (introduced by Vince) of a graph. Denoting these by χ \* and η \* , the work of the above authors shows that χ \* (G) = η \* (G) if G is bipartite, an odd cy

Binding number and minimum degree for k-

Binding number and minimum degree for k-factors

✍ Norihide Tokushige 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 282 KB

Numbers of cubic graphs

✍ R. W. Robinson; N. C. Wormald 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB

## Abstract The numbers of unlabeled cubic graphs on __p = 2n__ points have been found by two different counting methods, the best of which has given values for __p ≦__ 40.

On f-factors of a graph

✍ Jialong Lan; Wai-Kai Chen 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 404 KB

## This paper probes the relations between f-factors and subgraphs and their degree sequences in a graph when the graph has the odd-cycle property and contains no self-loop. Useful results are derived which greatly simplify tests of the existence of f-factors. z. zntrodactic?n