Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices (Q1944091): Difference between revisions
From MaRDI portal
Latest revision as of 08:38, 6 July 2024
scientific article
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 |
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