Analysis of a heuristic for acyclic edge colouring
type: Item
instance of: scholarly article
title: Analysis of a heuristic for acyclic edge colouring
zbMATH Open document ID: 1184.05051
author: C. R. Subramanian
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5664490
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: acyclic edge colouring
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.05.001
OpenAlex ID: W1995762848
cites work: Acyclic coloring of graphs
cites work: Algorithmic aspects of acyclic edge colorings
cites work: All-to-all wavelength-routing in all-optical compound networks
cites work: Q4180377
cites work: Acyclic colorings of planar graphs
cites work: Acyclic and oriented chromatic numbers of graphs
cites work: Q4542572
cites work: Q3439680
cites work: Optimal Acyclic Edge Colouring of Grid Like Graphs
cites work: The acyclic edge chromatic number of a random d‐regular graph is d + 1
cites work: Acyclic colorings of subcubic graphs
DOI: 10.1016/J.IPL.2006.05.001
description: scientific article; zbMATH DE number 5664490