A sufficient condition for a graph to contain three disjoint 1-factors (Q4742822)
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: A sufficient condition for a graph to contain three disjoint 1-factors |
scientific article; zbMATH DE number 3797799
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sufficient condition for a graph to contain three disjoint 1-factors |
scientific article; zbMATH DE number 3797799 |
Statements
A sufficient condition for a graph to contain three disjoint 1-factors (English)
0 references
1982
0 references
degree-condition
0 references
1-factor
0 references
Hamiltonian cycle
0 references
