Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (Q489724): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10878-012-9586-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2011909118 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4230860 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: List Improper Colourings of Planar Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3139765 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On $(3,1)^*$-Coloring of Plane Graphs / rank | |||
Normal rank |
Latest revision as of 13:40, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable |
scientific article |
Statements
Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable (English)
0 references
21 January 2015
0 references
planar graph
0 references
Steinberg's conjecture
0 references
improper coloring
0 references
0 references