Smaller planar triangle-free graphs that are not 3-list-colorable (Q1772422): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2004.10.015 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2137523248 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4065568 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Grötzsch's theorem on 3-colorings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of planar graph choosability / 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 |
Latest revision as of 10:00, 10 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Smaller planar triangle-free graphs that are not 3-list-colorable |
scientific article |
Statements
Smaller planar triangle-free graphs that are not 3-list-colorable (English)
0 references
18 April 2005
0 references
Planar graphs
0 references
Triangle-free graphs
0 references
List coloring
0 references