Planar graphs without 4-cycles adjacent to triangles are 4-choosable (Q738863): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2016.06.009 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2016.06.009 / rank | |||
Normal rank | |||
Latest revision as of 02:38, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without 4-cycles adjacent to triangles are 4-choosable |
scientific article |
Statements
Planar graphs without 4-cycles adjacent to triangles are 4-choosable (English)
0 references
16 August 2016
0 references
planar graph
0 references
triangular 4-cycle
0 references
choosability
0 references
discharging
0 references
