4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (Q2685332)
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 7655647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz |
scientific article; zbMATH DE number 7655647 |
Statements
4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (English)
0 references
21 February 2023
0 references
planar graphs
0 references
choosable
0 references
nice path
0 references
Combinatorial Nullstellensatz
0 references
0 references
0.8595444560050964
0 references
0.8410942554473877
0 references
0.8333523869514465
0 references
0.8280326128005981
0 references
0.8273407220840454
0 references
