Regular factors in regular graphs (Q2366028)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 223121
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Regular factors in regular graphs |
scientific article; zbMATH DE number 223121 |
Statements
Regular factors in regular graphs (English)
0 references
29 June 1993
0 references
The author shows that a \(k\)-regular \((k-1)\)-edge-connected graph with an even number of vertices has an \(m\)-factor not containing \(k-m\) arbitrarily prescribed edges whenever \(1\leq m\leq k-1\). This was known only for \(m=1\) or \(k-1\). Also the sharpness of this result and some corollaries are given.
0 references
reglar factors
0 references
regular graphs
0 references
0 references
0 references
0.97176594
0 references
0.9661671
0 references
0 references
0 references
0 references
0.94632715
0 references
