Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.disc.2009.04.010 / 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.disc.2009.04.010 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2084405650 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Colorings and orientations of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3922703 / 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: Q3635511 / 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: 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: Q3115277 / 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: Q3373266 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On 3-choosability of plane graphs without 6-, 7- and 9-cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3428684 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5442386 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DISC.2009.04.010 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:39, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Planar graphs without 3-, 7-, and 8-cycles are 3-choosable |
scientific article |
Statements
Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (English)
0 references
15 December 2009
0 references
choosability
0 references
list-coloring
0 references
planar graphs
0 references
short cycles
0 references