Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors (Q6586578)
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: Sufficient conditions for a graph kG admitting all [1, k]-factors |
scientific article; zbMATH DE number 7896074
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors |
scientific article; zbMATH DE number 7896074 |
Statements
Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors (English)
0 references
13 August 2024
0 references
spanning subgraph
0 references
\(\varphi\)-factor
0 references
\([1, k]\)-factors
0 references
0 references
0 references
0 references
0 references
0.8723211884498596
0 references
0.8101297616958618
0 references
0.8095658421516418
0 references
0.8079034686088562
0 references
