Improper Choosability and Property B (Q5325946): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3124063821 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1205.4283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choice Numbers of Graphs: a Probabilistic Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized list colourings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized list colourings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improper choosability of graphs of nonnegative characteristic / 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: A note on list improper coloring of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial problem. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On A Combinatorial Problem III / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic value of the choice number of complete multi‐partite 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: Q4726281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>t</i>-Improper Chromatic Number of Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs from lists with bounded size of their union / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on list improper coloring planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improper choosability of graphs embedded on the surface of genus \(r\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring and the probabilistic method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds and algorithms for hypergraph 2-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of panchromatic colourings for uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of Rubin's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Grötzsch-Type Theorem for List Colourings with Impropriety One / 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: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: List colourings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective choosability of graphs without small minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective choosability results for outerplanar and related graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective choosability of graphs with no edge-plus-independent-set minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3534281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable / rank
 
Normal rank

Latest revision as of 17:23, 6 July 2024

scientific article; zbMATH DE number 6193108
Language Label Description Also known as
English
Improper Choosability and Property B
scientific article; zbMATH DE number 6193108

    Statements

    Improper Choosability and Property B (English)
    0 references
    0 references
    0 references
    31 July 2013
    0 references
    0 references
    hypergraph 2-colorability
    0 references
    improper list colorings
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references