\((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436): 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 | \((1,0,0)\)-colorability of planar graphs without prescribed short cycles |
scientific article |
Statements
\((1,0,0)\)-colorability of planar graphs without prescribed short cycles (English)
0 references
28 September 2015
0 references
planar graph
0 references
Steinberg conjecture
0 references
improper coloring
0 references
cycle
0 references
