Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (Q2444905): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q977285 |
||
| Property / author | |||
| Property / author: Ying Qian Wang / rank | |||
Revision as of 16:08, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable |
scientific article |
Statements
Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (English)
0 references
11 April 2014
0 references
combinatorial problems
0 references
planar graph
0 references
cycle
0 references
improper coloring
0 references
