On \(r\)-hued colorings of graphs without short induced paths (Q2421855): 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.1016/j.disc.2019.03.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2937881716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the difference between chromatic number and dynamic chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the list dynamic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3001393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the dynamic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic chromatic number of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dynamic coloring for planar graphs and graphs of higher genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic list coloring of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-dynamic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-dynamic coloring of grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic coloring and list dynamic coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Dynamic Coloring of Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of conditional colorability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-hued coloring of \(K_4\)-minor free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-hued coloring of planar graphs with girth at least 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-dynamic chromatic number of graphs / rank
 
Normal rank

Latest revision as of 14:16, 19 July 2024

scientific article
Language Label Description Also known as
English
On \(r\)-hued colorings of graphs without short induced paths
scientific article

    Statements

    On \(r\)-hued colorings of graphs without short induced paths (English)
    0 references
    0 references
    0 references
    0 references
    18 June 2019
    0 references
    0 references
    \((k,r)\)-coloring
    0 references
    \(r\)-hued chromatic number
    0 references
    \((r,s)\)-normality
    0 references
    \(P_4\)-free graphs
    0 references
    \(P_5\)-free graphs
    0 references
    0 references