Analysis of a heuristic for acyclic edge colouring (Q845729): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Acyclic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of acyclic edge colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-to-all wavelength-routing in all-optical compound networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4180377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic and oriented chromatic numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3439680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Acyclic Edge Colouring of Grid Like Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The acyclic edge chromatic number of a random <i>d</i>‐regular graph is <i>d</i> + 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of subcubic graphs / rank
 
Normal rank

Latest revision as of 10:54, 2 July 2024

scientific article
Language Label Description Also known as
English
Analysis of a heuristic for acyclic edge colouring
scientific article

    Statements