On 1-improper 2-coloring of sparse graphs (Q393935): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alexandr V. Kostochka / rank
 
Normal rank
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.1016/j.disc.2013.07.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2198303752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List strong linear 2-arboricity of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((k,1)\)-coloring of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((k,j)\)-coloring of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an upper bound of the graph's chromatic number, depending on the graph's degree and density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective 2-colorings of sparse graphs / 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: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5516692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path partitions of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improper choosability of graphs and maximum average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally sparse vertex‐ramsey graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135588 / rank
 
Normal rank

Latest revision as of 07:14, 7 July 2024

scientific article
Language Label Description Also known as
English
On 1-improper 2-coloring of sparse graphs
scientific article

    Statements

    On 1-improper 2-coloring of sparse graphs (English)
    0 references
    0 references
    0 references
    0 references
    24 January 2014
    0 references
    improper coloring
    0 references
    sparse graph
    0 references
    maximum average degree
    0 references
    planar graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references