Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs (Q741726)
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 6344075
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs |
scientific article; zbMATH DE number 6344075 |
Statements
Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs (English)
0 references
12 September 2014
0 references
pseudo \([2,b]\)-factor
0 references
independence number
0 references
minimum degree
0 references
0.875887393951416
0 references
0.8211720585823059
0 references
0.8137159943580627
0 references
0.8009611964225769
0 references
0.7839542627334595
0 references
