Generalized arboricity of graphs with large girth (Q1732768): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2019.01.018 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrepetitive colouring via entropy compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic edge-coloring using entropy compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalised acyclic edge colourings of graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the generalised acyclic chromatic numbers of bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approach to nonrepetitive sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a graph into forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of the general lovász local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring edges with many colours in cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3808121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the perfect one-factorization conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a planar graph with girth at least 8 into a forest and a matching / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128492752 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2019.01.018 / rank
 
Normal rank

Latest revision as of 06:30, 11 December 2024

scientific article
Language Label Description Also known as
English
Generalized arboricity of graphs with large girth
scientific article

    Statements

    Generalized arboricity of graphs with large girth (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 March 2019
    0 references
    arboricity
    0 references
    acyclic chromatic index
    0 references
    bounded expansion
    0 references
    entropy compression
    0 references

    Identifiers