Every 4-regular graph is acyclically edge-6-colorable (Q6235598)
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: Every 4-regular graph is acyclically edge-6-colorable |
scientific article; zbMATH DE number 900147211
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every 4-regular graph is acyclically edge-6-colorable |
scientific article; zbMATH DE number 900147211 |
Statements
11 September 2012
0 references
math.CO
0 references
cs.DM
0 references
