Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable |
scientific article |
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
