Linear and 2-frugal choosability of graphs of small maximum average degree (Q659749)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear and 2-frugal choosability of graphs of small maximum average degree |
scientific article; zbMATH DE number 5999874
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear and 2-frugal choosability of graphs of small maximum average degree |
scientific article; zbMATH DE number 5999874 |
Statements
Linear and 2-frugal choosability of graphs of small maximum average degree (English)
0 references
24 January 2012
0 references
linear colouring
0 references
frugal colouring
0 references
planar graph
0 references
discharging method
0 references
0.8512393832206726
0 references
0.8467081785202026
0 references
0.8297672867774963
0 references
0.8273055553436279
0 references
0.8220535516738892
0 references
