Improper Choosability and Property B
From MaRDI portal
Publication:5325946
DOI10.1002/jgt.21680zbMath1269.05035arXiv1205.4283MaRDI QIDQ5325946
Publication date: 31 July 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.4283
Related Items
Improper colouring of graphs with no odd clique minor, On improperly chromatic-choosable graphs, On generalized choice and coloring numbers, Distance-two coloring of sparse graphs, List Coloring with a Bounded Palette
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List colourings of planar graphs
- On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
- Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
- Planar graphs are 1-relaxed, 4-choosable
- A note on list improper coloring of plane graphs
- Every planar graph is 5-choosable
- Improper choosability of graphs embedded on the surface of genus \(r\)
- Defective choosability results for outerplanar and related graphs
- List improper colorings of planar graphs with prescribed girth
- Defective choosability of graphs without small minors
- Improper choosability of graphs of nonnegative characteristic
- On a generalization of Rubin's theorem
- The t-Improper Chromatic Number of Random Graphs
- The existence of panchromatic colourings for uniform hypergraphs
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- On generalized list colourings of graphs
- Combinatorial Nullstellensatz
- List Improper Colourings of Planar Graphs
- Choice Numbers of Graphs: a Probabilistic Approach
- Defective choosability of graphs with no edge-plus-independent-set minor
- Generalized list colourings of graphs
- A Grötzsch-Type Theorem for List Colourings with Impropriety One
- Improved bounds and algorithms for hypergraph 2-coloring
- Coloring graphs from lists with bounded size of their union
- On the asymptotic value of the choice number of complete multi‐partite graphs
- Improper choosability of graphs and maximum average degree
- On A Combinatorial Problem III
- On a property of families of sets
- On a combinatorial problem. II
- A note on list improper coloring planar graphs
- Graph colouring and the probabilistic method
