Improved upper bound for generalized acyclic chromatic number of graphs (Q1617036)

From MaRDI portal
Revision as of 23:45, 23 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Improved upper bound for generalized acyclic chromatic number of graphs
scientific article

    Statements

    Improved upper bound for generalized acyclic chromatic number of graphs (English)
    0 references
    0 references
    0 references
    7 November 2018
    0 references
    girth
    0 references
    coloring
    0 references
    acyclic coloring
    0 references
    \(r\)-acyclic coloring
    0 references
    lopsided local lemma
    0 references

    Identifiers