Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (Q2444905): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2013.06.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051849612 / rank | |||
Normal rank | |||
Revision as of 02:30, 20 March 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
