Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (Q489724): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Zheng-Ke Miao / rank
Normal rank
 
Property / author
 
Property / author: Ying Qian Wang / rank
Normal rank
 
Property / author
 
Property / author: Zheng-Ke Miao / rank
 
Normal rank
Property / author
 
Property / author: Ying Qian Wang / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6388497 / rank
 
Normal rank
Property / zbMATH Keywords
 
planar graph
Property / zbMATH Keywords: planar graph / rank
 
Normal rank
Property / zbMATH Keywords
 
Steinberg's conjecture
Property / zbMATH Keywords: Steinberg's conjecture / rank
 
Normal rank
Property / zbMATH Keywords
 
improper coloring
Property / zbMATH Keywords: improper coloring / 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.1007/s10878-012-9586-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011909118 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 22:29, 19 March 2024

scientific article
Language Label Description Also known as
English
Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
scientific article

    Statements

    Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2015
    0 references
    planar graph
    0 references
    Steinberg's conjecture
    0 references
    improper coloring
    0 references

    Identifiers