On \(r\)-hued coloring of \(K_4\)-minor free graphs (Q393165): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2013.10.001 / 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: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / 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: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic list coloring of bipartite 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: Complexity of conditional colorability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the square of a \(K_{4}\)-minor free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The four-colour theorem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2013.10.001 / rank
 
Normal rank

Latest revision as of 16:14, 9 December 2024

scientific article
Language Label Description Also known as
English
On \(r\)-hued coloring of \(K_4\)-minor free graphs
scientific article

    Statements

    On \(r\)-hued coloring of \(K_4\)-minor free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 January 2014
    0 references
    (\(k
    0 references
    r\))-coloring
    0 references
    \(r\)-hued coloring
    0 references
    \(r\)-hued list coloring
    0 references
    planar graph
    0 references

    Identifiers