\((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6485832 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
planar graph | |||
| Property / zbMATH Keywords: planar graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Steinberg conjecture | |||
| Property / zbMATH Keywords: Steinberg conjecture / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
improper coloring | |||
| Property / zbMATH Keywords: improper coloring / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
cycle | |||
| Property / zbMATH Keywords: cycle / rank | |||
Normal rank | |||
Revision as of 23:40, 30 June 2023
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
