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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Lei Sun / rank
Normal rank
 
Property / author
 
Property / author: Lei Sun / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6246063 / rank
 
Normal rank
Property / zbMATH Keywords
 
(\(k
Property / zbMATH Keywords: (\(k / rank
 
Normal rank
Property / zbMATH Keywords
 
r\))-coloring
Property / zbMATH Keywords: r\))-coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
\(r\)-hued coloring
Property / zbMATH Keywords: \(r\)-hued coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
\(r\)-hued list coloring
Property / zbMATH Keywords: \(r\)-hued list coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
planar graph
Property / zbMATH Keywords: planar graph / rank
 
Normal rank
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.2013.10.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998680513 / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:31, 7 July 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
    0 references
    (\(k
    0 references
    r\))-coloring
    0 references
    \(r\)-hued coloring
    0 references
    \(r\)-hued list coloring
    0 references
    planar graph
    0 references
    0 references