On the complexity of computing the excessive \([B]\)-index of a graph (Q2811195)
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: On the Complexity of Computing the Excessive [B]-Index of a Graph |
scientific article; zbMATH DE number 6591585
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of computing the excessive \([B]\)-index of a graph |
scientific article; zbMATH DE number 6591585 |
Statements
10 June 2016
0 references
chromatic index
0 references
matching
0 references
excessive \([B]\)-factorization
0 references
excessive \([B]\)-index
0 references
0.89438117
0 references
0 references
0.8851917
0 references
0.8834465
0 references
0.8803172
0 references
0.8756906
0 references
0.87486017
0 references
0.8743216
0 references
On the complexity of computing the excessive \([B]\)-index of a graph (English)
0 references
