𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Degree Sum Conditions for Cyclability in Bipartite Graphs

✍ Scribed by Haruko Okamura, Tomoki Yamashita

Book ID
120788695
Publisher
Springer Japan
Year
2012
Tongue
English
Weight
215 KB
Volume
29
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Supereulerian graphs, independent sets,
Supereulerian graphs, independent sets, and degree-sum conditions
✍ Zhi-Hong Chen πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 573 KB

A graph is supereulerian if it contains a spanning closed trail. A graph G is collapsible if for every even subset R C V(G), there is a spanning connected subgraph of G whose set of odd degree vertices is R. The graph K1 is regarded as a trivial collapsible graph. A graph is reduced if it contains n

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