𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bipartite Graph Tiling

✍ Scribed by Zhao, Yi

Book ID
118197633
Publisher
Society for Industrial and Applied Mathematics
Year
2009
Tongue
English
Weight
235 KB
Volume
23
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Note on Bipartite Graph Tiling
A Note on Bipartite Graph Tiling
✍ Czygrinow, Andrzej; DeBiasio, Louis πŸ“‚ Article πŸ“… 2011 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 274 KB
Minimum degree thresholds for bipartite
Minimum degree thresholds for bipartite graph tiling
✍ Albert Bush; Yi Zhao πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 361 KB

## Abstract Given a bipartite graph __H__ and a positive integer __n__ such that __v__(__H__) divides 2__n__, we define the minimum degree threshold for bipartite __H__‐tiling, Ξ΄~2~(__n, H__), as the smallest integer __k__ such that every bipartite graph __G__ with __n__ vertices in each partition

Combinatorics of perfect matchings in pl
Combinatorics of perfect matchings in plane bipartite graphs and application to tilings
✍ J.C. Fournier πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 737 KB

Let G be a plane bipartite graph which admits a perfect matching and with distinguished faces called holes. Let MG denote the perfect matchings graph: its vertices are the perfect matchings of G, two of them being joined by an edge, if and only if they di er only on an alternating cycle bounding a f

Packing two bipartite graphs into a comp
Packing two bipartite graphs into a complete bipartite graph
✍ Wang, Hong πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 131 KB πŸ‘ 3 views

For two integers a and b, we say that a bipartite graph G admits an (a, b)bipartition if G has a bipartition (X, Y ) such that |X| = a and |Y | = b. We say that two bipartite graphs G and H are compatible if, for some integers a and b, both G and H admit (a, b)-bipartitions. In this paper, we prove