An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs (Q3004663): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Acyclic edge colorings of graphs / rank
 
Normal rank
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: Acyclic edge coloring of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Acyclic and Star Coloring Algorithms with Application to Computing Hessians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542572 / 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 03:34, 4 July 2024

scientific article
Language Label Description Also known as
English
An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs
scientific article

    Statements

    Identifiers