𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two sufficient conditions for a 2-factor in a bipartite graph

✍ Scribed by P. Katerinis

Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
186 KB
Volume
11
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.

On 2-factors of a bipartite graph
On 2-factors of a bipartite graph
✍ Wang, Hong πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 191 KB πŸ‘ 2 views

In this article, we consider the following problem: Given a bipartite graph G and a positive integer k, when does G have a 2-factor with exactly k components? We will prove that if , then, for any bipartite graph H = (U 1 , U 2 ; F ) with |U 1 | ≀ n, |U 2 | ≀ n and βˆ†(H) ≀ 2, G contains a subgraph i

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.