Planar graphs with \(\Delta \geq 7\) and no triangle adjacent to a \(C_{4}\) are minimally edge and total choosable (Q2808541)
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: Planar graphs with 7 and no triangle adjacent to a C₄ are minimally edge and total choosable |
scientific article; zbMATH DE number 6584114
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs with \(\Delta \geq 7\) and no triangle adjacent to a \(C_{4}\) are minimally edge and total choosable |
scientific article; zbMATH DE number 6584114 |
Statements
24 May 2016
0 references
planar graphs
0 references
edge coloring
0 references
discharging
0 references
cs.DM
0 references
math.CO
0 references
Planar graphs with \(\Delta \geq 7\) and no triangle adjacent to a \(C_{4}\) are minimally edge and total choosable (English)
0 references
0.9021485447883606
0 references
0.8884462118148804
0 references
0.8866195678710938
0 references
0.882411777973175
0 references
