The color number of cubic graphs having a spanning tree with a bounded number of leaves (Q3380402)
From MaRDI portal
!
WARNING
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 7402124
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The color number of cubic graphs having a spanning tree with a bounded number of leaves |
scientific article; zbMATH DE number 7402124 |
Statements
The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves (English)
0 references
28 September 2021
0 references
\(k\)-edge-coloring
0 references
edge-chromatic number
0 references
chromatic index
0 references
0.7950388789176941
0 references
0.7860623002052307
0 references
0.7820529937744141
0 references
0.7769706845283508
0 references
0.7762388586997986
0 references
