Neighborhood conditions and \(k\)-factors (Q1382850)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Neighborhood conditions and \(k\)-factors |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neighborhood conditions and \(k\)-factors |
scientific article |
Statements
Neighborhood conditions and \(k\)-factors (English)
0 references
5 October 1998
0 references
A \(k\)-factor of a graph \(G\) is a spanning subgraph which is regular of degree \(k\). The authors give conditions involving a lower bound on the order \(n\) of \(G\), the parity of \(kn\), the minmum degree of \(G\), and the cardinalities of the unions of neighborhoods of non-adjacent vertices which guarantee that \(G\) has a \(k\)-factor.
0 references
\(k\)-factor
0 references
