Planar graphs without 4-cycles adjacent to triangles are 4-choosable (Q738863)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6617202
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs without 4-cycles adjacent to triangles are 4-choosable |
scientific article; zbMATH DE number 6617202 |
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
0.9400360584259032
0 references
0.9106571674346924
0 references
0.9022688269615172
0 references
0.9000715613365173
0 references
0.8934146165847778
0 references
