A non-3-choosable planar graph without cycles of length 4 and 5 (Q868377): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4000782 / 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: A sufficient condition for planar graphs to be 3-colorable / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On structure of some plane graphs with application to choosability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on list improper coloring planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the three color problem / 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: A not 3-choosable planar graph without 3-cycles / rank | |||
Normal rank |
Latest revision as of 15:25, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A non-3-choosable planar graph without cycles of length 4 and 5 |
scientific article |
Statements
A non-3-choosable planar graph without cycles of length 4 and 5 (English)
0 references
2 March 2007
0 references
choosability
0 references
forbidden cycles
0 references
0 references