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 |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8795933723449707
0 references
0.8775761127471924
0 references
0.8684774041175842
0 references
0.8587362170219421
0 references
0.8507573008537292
0 references
