Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs (Q2259863): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2098118748 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1402.1813 / 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: Dirac's map-color theorem for choosability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On list-coloring extendable outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two / rank
 
Normal rank
Property / cites work
 
Property / cites work: The four-colour theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially many 5-list-colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List colourings of planar graphs / rank
 
Normal rank

Latest revision as of 18:39, 9 July 2024

scientific article
Language Label Description Also known as
English
Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs
scientific article

    Statements

    Identifiers