A new bound on the cyclic chromatic number (Q1850557): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cyclic colorings and their generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5591378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The four-colour theorem / rank
 
Normal rank

Latest revision as of 19:10, 4 June 2024

scientific article
Language Label Description Also known as
English
A new bound on the cyclic chromatic number
scientific article

    Statements

    A new bound on the cyclic chromatic number (English)
    0 references
    0 references
    0 references
    10 December 2002
    0 references
    0 references
    angular coloring
    0 references
    face coloring
    0 references
    0 references