✦ LIBER ✦

Factors of Locally almost Regular Graphs

✍ Scribed by Joentgen, A.; Volkmann, L.

Book ID: 120092845
Publisher: Oxford University Press
Year: 1991
Tongue: English
Weight: 54 KB
Volume: 23
Category: Article
ISSN: 0024-6093
DOI: 10.1112/blms/23.2.121

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 +

Regular subgraphs of almost regular grap

Regular subgraphs of almost regular graphs

✍ N Alon; S Friedland; G Kalai 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 628 KB

Locally regular coloured graphs

✍ Antonio F. Costa 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 680 KB

Regular factors of regular graphs

✍ B. Bollobás; Akira Saito; N. C. Wormald 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB

Given r 3 3 and 1 s A s r, we determine all values of k for which every r-regular graph with edge-connectivity A has a k-factor. Some of the earliest results in graph theory are due to Petersen [8] and concern factors in graphs. Among others, Petersen proved that a regular graph of even degree has a

Maximum Matching in Regular and Almost R

Maximum Matching in Regular and Almost Regular Graphs

✍ Raphael Yuster 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 273 KB

A Note on Almost Regular Graphs

✍ M. Of Hofmeister Munich 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

It can easily be seen that a conjecture of RUNGE does not hold for a class of graphs whose members will be called "almost regular". This conjecture is replaced by a weaker one, and a classification of almost regular graphs is given.