Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q977285 |
Changed an Item |
||
| Property / author | |||
| Property / author: Ying Qian Wang / rank | |||
Normal rank | |||
Revision as of 15:07, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable |
scientific article |
Statements
Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (English)
0 references
16 August 2016
0 references
planar graph
0 references
\((d_1,d_2,\ldots,d_k)\)-coloring
0 references
reducible configuration
0 references
discharging
0 references
