A sufficient condition for a planar graph to be 3-choosable (Q2380013): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ying Qian Wang / rank
Normal rank
 
Property / author
 
Property / author: Ying Qian Wang / 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.ipl.2007.06.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031219849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-choosability of plane graphs of girth 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-list-coloring planar graphs of girth 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List colourings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bordeaux 3-color conjecture and 3-choosability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the not 3-choosability of some families of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on 3-choosability of planar graphs without certain cycles / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:25, 2 July 2024

scientific article
Language Label Description Also known as
English
A sufficient condition for a planar graph to be 3-choosable
scientific article

    Statements