Defective DP-colorings of sparse simple graphs (Q2237221): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q312270
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 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 / OpenAlex ID
 
Property / OpenAlex ID: W3203473676 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2006.10244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on defective colorings of graphs in surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On DP-coloring of graphs and multigraphs / 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,j)\)-coloring of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((k,1)\)-coloring of sparse graphs / 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: On 1-improper 2-coloring 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: Planar graphs are 1-relaxed, 4-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of Near-Coloring of Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Relative of Hadwiger's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Dichotomy for the Coloring of Sparse 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: Defective and clustered choosability of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective DP-colorings of sparse multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum average degree and relaxed coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-defective DP-colorings of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective colouring of graphs excluding a subgraph or minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Improper Colourings of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List improper colorings of planar graphs with prescribed girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improper colourings inspired by Hadwiger's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective and clustered graph colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective choosability of graphs in surfaces / rank
 
Normal rank

Latest revision as of 21:57, 26 July 2024

scientific article
Language Label Description Also known as
English
Defective DP-colorings of sparse simple graphs
scientific article

    Statements

    Defective DP-colorings of sparse simple graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 October 2021
    0 references
    defective coloring
    0 references
    list coloring
    0 references
    DP-coloring
    0 references
    0 references
    0 references

    Identifiers