Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices (Q1944091): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2010.12.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000814123 / rank | |||
Normal rank | |||
Revision as of 01:38, 20 March 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
