Generalized acyclic edge colorings via entropy compression (Q1743494): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-017-0244-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2781740686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for the acyclic chromatic index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic edge colourings of graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic edge-coloring using entropy compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized acyclic edge chromatic number of random regular graphs / 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: On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds on coloring of graphs / 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: Q4542572 / 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: 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: On the Facial Thue Choice Index via Entropy Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on acyclic vertex-colorings / rank
 
Normal rank

Latest revision as of 11:12, 15 July 2024

scientific article
Language Label Description Also known as
English
Generalized acyclic edge colorings via entropy compression
scientific article

    Statements

    Generalized acyclic edge colorings via entropy compression (English)
    0 references
    13 April 2018
    0 references
    \(r\)-acyclic edge coloring
    0 references
    entropy compression
    0 references
    list coloring
    0 references
    large girth
    0 references
    0 references
    0 references
    0 references

    Identifiers