𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Regular factors in regular multipartite graphs

✍ Scribed by Arne Hoffmann

Book ID
108315749
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
226 KB
Volume
258
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Regular factors in regular multipartite
Regular factors in regular multipartite graphs
✍ Arne Hoffmann πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 226 KB

We present sufficient conditions for a regular multipartite graph to have a regular factor. These conditions are best possible

Regular factors in regular graphs
Regular factors in regular graphs
✍ P. Katerinis πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 473 KB

Katerinis, P., Regular factors in regular graphs, Discrete Mathematics 113 (1993) 269-274. Let G be a k-regular, (k -I)-edge-connected graph with an even number of vertices, and let m be an integer such that 1~ m s k -1. Then the graph obtained by removing any k -m edges of G, has an m-factor.

Regular factors in nearly regular graphs
Regular factors in nearly regular graphs
✍ Jean-Claude Bermond; Michel Las Vergnas πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 232 KB
Regular factors of regular graphs
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

Regular Graphs, Eigenvalues and Regular
Regular Graphs, Eigenvalues and Regular Factors
✍ Hongliang Lu πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 97 KB

## Abstract In this article, we obtain a sufficient condition for the existence of regular factors in a regular graph in terms of its third largest eigenvalue. We also determine all values of __k__ such that every __r__‐regular graph with the third largest eigenvalue at most has a __k__‐factor.