Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices (Q1944091)
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: Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices |
scientific article; zbMATH DE number 6150269
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices |
scientific article; zbMATH DE number 6150269 |
Statements
Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices (English)
0 references
4 April 2013
0 references
acyclic edge colouring
0 references
combinatorial problems
0 references
graph algorithms
0 references
