Acyclic coloring of graphs without bichromatic long path (Q889416): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11464-015-0497-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2109280440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of graphs on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic list 7‐coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colouring of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for planar graphs to be acyclically 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without 4- and 5-cycles are acyclically 4-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic 4-choosability of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of sparse hessian matrices and graph coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic edge-coloring using entropy compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note to the paper of Grünbaum on acyclic colorings / 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: Acyclic 5-choosability of planar graphs without small cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of the general lovász local lemma / rank
 
Normal rank

Latest revision as of 00:27, 11 July 2024

scientific article
Language Label Description Also known as
English
Acyclic coloring of graphs without bichromatic long path
scientific article

    Statements

    Acyclic coloring of graphs without bichromatic long path (English)
    0 references
    0 references
    0 references
    6 November 2015
    0 references
    coloring
    0 references
    acyclic
    0 references
    path
    0 references
    entropy compression
    0 references

    Identifiers