Some degree conditions for \(\mathcal{P}_{\geq k}\)-factor covered graphs (Q5034714)
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 7477166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some degree conditions for \(\mathcal{P}_{\geq k}\)-factor covered graphs |
scientific article; zbMATH DE number 7477166 |
Statements
Some degree conditions for 𝒫<sub>≥<i>k</i></sub>-factor covered graphs (English)
0 references
21 February 2022
0 references
\(\mathcal{P}_{\geq 2}\)-factor covered graph
0 references
\(\mathcal{P}_{\geq 3}\)-factor covered graph
0 references
planar graph
0 references
minimum degree
0 references
0.9111430048942566
0 references
0.9029353260993958
0 references
0.9018235206604004
0 references
0.88173508644104
0 references
0.8713598847389221
0 references
