A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable (Q975410): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3922703 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Smaller planar triangle-free graphs that are not 3-list-colorable / 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: Bordeaux 3-color conjecture and 3-choosability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3139765 / 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 |
Latest revision as of 22:24, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable |
scientific article |
Statements
A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable (English)
0 references
9 June 2010
0 references
combinatorial problems
0 references
planar graph
0 references
list coloring
0 references
3-choosable
0 references