On the Complexity of Computing the Excessive [<i>B</i>]-Index of a Graph (Q2811195)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Computing the Excessive [<i>B</i>]-Index of a Graph |
scientific article |
Statements
On the Complexity of Computing the Excessive [<i>B</i>]-Index of a Graph (English)
0 references
10 June 2016
0 references
chromatic index
0 references
matching
0 references
excessive \([B]\)-factorization
0 references
excessive \([B]\)-index
0 references
