Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2020.111846 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2020.111846 / rank | |||
Normal rank | |||
Latest revision as of 08:43, 17 December 2024
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
