Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
type: Item
instance of: scholarly article
title: Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
zbMATH Open document ID: 1259.05058
author: Anna Fiedorowicz
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6150269
zbMATH Keywords: acyclic edge colouring
zbMATH Keywords: combinatorial problems
zbMATH Keywords: graph algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.12.002
OpenAlex ID: W2000814123
cites work: Acyclic coloring of graphs
cites work: Algorithmic aspects of acyclic edge colorings
cites work: Acyclic edge colouring of planar graphs without short cycles
cites work: Q4947393
cites work: About acyclic edge colourings of planar graphs
cites work: Q4542572
cites work: Optimal Acyclic Edge Colouring of Grid Like Graphs
cites work: Acyclic Edge Colouring of Outerplanar Graphs
cites work: Acyclic colorings of subcubic graphs
cites work: Analysis of a heuristic for acyclic edge colouring
DOI: 10.1016/J.IPL.2010.12.002
description: scientific article; zbMATH DE number 6150269