Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590)
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 7191178
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable |
scientific article; zbMATH DE number 7191178 |
Statements
Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (English)
0 references
21 April 2020
0 references
planar graph
0 references
bad cycle
0 references
superextension
0 references
discharging
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8925891518592834
0 references
0.8907896876335144
0 references
0.8898868560791016
0 references
0.871135950088501
0 references
