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 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: Acyclic edge colouring of planar graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: About acyclic edge colourings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542572 / 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: Acyclic Edge Colouring of Outerplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a heuristic for acyclic edge colouring / rank
 
Normal rank

Latest revision as of 08:38, 6 July 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
    0 references
    4 April 2013
    0 references
    0 references
    acyclic edge colouring
    0 references
    combinatorial problems
    0 references
    graph algorithms
    0 references
    0 references