𝔖 Bobbio Scriptorium
✦   LIBER   ✦

f-Factors in bipartite (mf)-graphs

✍ Scribed by Guizhen Liu; Wenan Zang

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
227 KB
Volume
136
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis

Katerinis and Tsikopoulos (Graphs. Combin. 12 (1996) 327)

give su cient conditions for a regular bipartite graph to have a perfect matching excluding a set of edges. In this paper, we give a necessary and su cient condition for a bipartite graph to have an f-factor containing a set of edges and excluding another set of edges and discuss some applications of this condition.

In particular, we obtain some su cient conditions related to connectivity and edge-connectivity for a bipartite (mf)-graph to have an f-factor with special properties and generalize the results in (Graphs. Combin. 12 (1996) 327). The results in this paper are in some sense best possible.

πŸ“œ SIMILAR VOLUMES

Path factors of bipartite graphs
Path factors of bipartite graphs
✍ Hong Wang πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 375 KB

## Abstract A path on __n__ vertices is denoted by __P__~__n__~. For any graph __H__, the number of isolated vertices of __H__ is denoted by __i(H)__. Let __G__ be a graph. A spanning subgraph __F__ of __G__ is called a {__P__~3~, __P__~4~, __P__~5~}‐factor of __G__ if every component of __F__ is o

Counting 1-Factors in Regular Bipartite
Counting 1-Factors in Regular Bipartite Graphs
✍ Alexander Schrijver πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 325 KB

We show that any k-regular bipartite graph with 2n vertices has at least \ (k&1) k&1 k k&2 + n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent of any nonnegative integer n\_n matrix with each row and column sum equal to k. For any k, the base (k&1) k&1 Γ‚k k&2 is l

Cycles in 2-Factors of Balanced Bipartit
Cycles in 2-Factors of Balanced Bipartite Graphs
✍ Guantao Chen; Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesn πŸ“‚ Article πŸ“… 2000 πŸ› Springer Japan 🌐 English βš– 190 KB