𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A sufficient condition for a bipartite graph to have a k-factor

✍ Scribed by Hikoe Enomoto; Katsuhiro Ota; Mikio Kano

Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
308 KB
Volume
12
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A sufficient condition for bipartite gra
A sufficient condition for bipartite graphs to be type one
✍ Xu, Baogang πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 58 KB πŸ‘ 2 views

The total chromatic number Ο‡ T (G) of graph G is the least number of colors assigned to V (G) βˆͺ E(G) such that no adjacent or incident elements receive the same color. In this article, we give a sufficient condition for a bipartite graph G to have Ο‡ T (G) = βˆ†(G) + 1.

A degree condition for a graph to have [
A degree condition for a graph to have [a,b]-factors
✍ Li, Yanjun; Mao-cheng, Cai πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 131 KB πŸ‘ 2 views

Let G be a graph of order n, and let a and b be integers such that a+b for any two nonadjacent vertices u and v in G. This result is best possible, and it is an extension of T. Iida and T. Nishimura's results (T. Iida and T. Nishimura, An Ore-type condition for the existence of k-factors in graphs,

A sufficient condition for a graph to co
A sufficient condition for a graph to contain three disjoint 1-factors
✍ Sein Win πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 219 KB πŸ‘ 1 views

## Abstract Ore derived a sufficient condition for a graph to contain a Hamiltonian cycle. We obtain a sufficient condition, similar to Ore's condition, for a graph to contain a Hamiltonian cycle and a 1‐factor which are edge disjoint.