✦ LIBER ✦

Regular Multigraphs of High Degree are 1-Factorizable

✍ Scribed by Plantholt, M. J.; Tipnis, S. K.

Book ID: 120094795
Publisher: Oxford University Press
Year: 1991
Tongue: English
Weight: 177 KB
Volume: s2-44
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s2-44.3.393

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regular Graphs of High Degree are 1-Fact

Regular Graphs of High Degree are 1-Factorizable

✍ Chetwynd, A. G.; Hilton, A. J. W. 📂 Article 📅 1985 🏛 Oxford University Press 🌐 English ⚖ 283 KB

1-factorizing regular graphs of high deg

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

✍ A.G. Chetwynd; A.J.W. Hilton 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 504 KB

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 ,

Edge coloring regular graphs of high deg

Edge coloring regular graphs of high degree

✍ L Perkovic; B Reed 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 738 KB

Finite element with high degree of regul

Finite element with high degree of regularity

✍ G. Dupuis; J.-J. Goël 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 502 KB

The total chromatic number of regular gr

The total chromatic number of regular graphs of high degree

✍ DeZheng Xie; WanNian Yang 📂 Article 📅 2009 🏛 SP Science China Press 🌐 English ⚖ 309 KB