𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximum Matching in Regular and Almost Regular Graphs

✍ Scribed by Raphael Yuster

Book ID
120909970
Publisher
Springer
Year
2012
Tongue
English
Weight
273 KB
Volume
66
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Almost-regular factorization of graphs
Almost-regular factorization of graphs
✍ Jin Akiyama; Mikio Kano πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 238 KB

For integers a and b, 0 s a s b, an [a,bl-graph G satisfies a s deg(x,G) s b for every vertex x of G, and an [a.bl-factor is a spanning subgraph its edges can be decomposed into [a,bl-factors. When both k and tare positive integers and s is a nonnegative integer, w e prove that every [(12k + 2)t +

Almost regular edge colorings and regula
Almost regular edge colorings and regular decompositions of complete graphs
✍ Darryn Bryant; Barbara Maenhaut πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 127 KB

## Abstract For __k__ = 1 and __k__ = 2, we prove that the obvious necessary numerical conditions for packing __t__ pairwise edge‐disjoint __k__‐regular subgraphs of specified orders __m__~1~,__m__~2~,… ,__m__~t~ in the complete graph of order __n__ are also sufficient. To do so, we present an edge

Maximum genus of regular graphs
Maximum genus of regular graphs
✍ M. Kotrbčík πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 181 KB