A note on 3-choosability of plane graphs under distance restrictions (Q2966511): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings of plane graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / 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 relaxation of Havel's 3-color problem / 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: Q4135588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List colourings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A not 3-choosable planar graph without 3-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-3-choosable planar graph without cycles of length 4 and 5 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s1793830917500112 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2562711669 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:40, 30 July 2024

scientific article
Language Label Description Also known as
English
A note on 3-choosability of plane graphs under distance restrictions
scientific article

    Statements

    Identifiers