𝔖 Bobbio Scriptorium
✦   LIBER   ✦

1-factorizing regular graphs of high degree—an improved bound

✍ Scribed by A.G. Chetwynd; A.J.W. Hilton

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
504 KB
Volume
75
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Factorizations of regular graphs of high
Factorizations of regular graphs of high degree
✍ A. J. W. Hilton 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 1 views

A p-factor of a graph G is a regular spanning subgraph of degree p . For G regular of degree d ( G ) and order 2n, let ( p l , ..., p,) be a partition of d ( G ) , so that p i > 0 ( I S i S r ) and p , i i pr = d(G). If H I . ..., H, are edge-disjoint regular spanning subgraphs of G of degrees p I ,

A degree condition for the existence of
A degree condition for the existence of regular factors inK1,n-free graphs
✍ Ota, Katsuhiro; Tokuda, Taro 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB 👁 2 views

A graph is called K1,.-free if it contains no K l , n as an induced subgraph. Let n ( r 3), r be integers (if r is odd, r 2 n -1). We prove that every Kl,,-free connected graph G with rlV(G)I even has an r-factor if its minimum degree is at least This degree condition is sharp.