List Improper Colourings of Planar Graphs
From MaRDI portal
Recommendations
- A note on list improper coloring planar graphs
- List improper colorings of planar graphs with prescribed girth
- A note on list improper coloring of plane graphs
- List colourings of planar graphs
- List improper coloring of graphs of nonnegative characteristic
- Acyclic improper list coloring of graphs
- scientific article; zbMATH DE number 1250667
- A note on improper colorability of planar graphs
- List colourings of planar graphs. (Reprint)
- List Colouring Squares of Planar Graphs
Cited in
(77)- A note on list improper coloring of plane graphs
- Improper choosability of graphs embedded on the surface of genus r
- A simple competitive graph coloring algorithm. II.
- Path choosability of planar graphs
- Defective 3-paintability of planar graphs
- List improper colorings of planar graphs with prescribed girth
- Sufficient conditions on planar graphs to have a relaxed DP-3-coloring
- Acyclic improper choosability of subcubic graphs
- The Alon-Tarsi number of \(K_5\)-minor-free graphs
- Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles
- Every planar graph with girth at least 5 is (1,9)-colorable
- The Alon-Tarsi number of a planar graph minus a matching
- On 2-defective DP-colorings of sparse graphs
- Defective DP-colorings of sparse multigraphs
- Defective DP-colorings of sparse simple graphs
- Near-colorings: non-colorable graphs and NP-completeness
- The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)
- Channel assignment problem and relaxed 2-distant coloring of graphs
- Planar graphs with girth at least 5 are \((3, 4)\)-colorable
- (3, 1)-choosability of toroidal graphs with some forbidden short cycles
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
- Improper choosability of graphs of nonnegative characteristic
- Improper colorability of planar graphs without prescribed short cycles
- Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
- Improper colouring of (random) unit disk graphs
- Every planar graph is 1-defective \((9,2)\)-paintable
- Decomposition of planar graphs with forbidden configurations
- (3, 1)^*-choosability of graphs of nonnegative characteristic without intersecting short cycles
- Limits of near-coloring of sparse graphs
- (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
- List strong linear 2-arboricity of sparse graphs
- scientific article; zbMATH DE number 4134069 (Why is no real title available?)
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
- Improper coloring of unit disk graphs
- A \((3,1)^\ast\)-choosable theorem on planar graphs
- ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
- Improper Colourings of Unit Disk Graphs
- Acyclic improper choosability of graphs
- The \(t\)-improper chromatic number of random graphs
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
- \((k,1)\)-coloring of sparse graphs
- \((k,j)\)-coloring of sparse graphs
- scientific article; zbMATH DE number 1250667 (Why is no real title available?)
- scientific article; zbMATH DE number 1146231 (Why is no real title available?)
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
- Planar graphs with girth at least 5 are (3, 5)-colorable
- Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
- On improperly chromatic-choosable graphs
- Splitting planar graphs of girth 6 into two linear forests with short paths
- Collective dynamics of phase-repulsive oscillators solves graph coloring problem
- Improper choosability and property B
- Improper choosability of graphs and maximum average degree
- Graph-Theoretic Concepts in Computer Science
- A note on list improper coloring planar graphs
- Locally planar graphs are 2-defective 4-paintable
- Decomposing planar graphs into graphs with degree restrictions
- A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles
- Decomposition of toroidal graphs without some subgraphs
- Weak (2, 3)-decomposition of planar graphs
- Sparse critical graphs for defective DP-colorings
- Decomposing graphs of nonnegative characteristic into subgraphs with degree restrictions
- Planar graphs without 4- and 6-cycles are \(( 3 , 4 )\)-colorable
- A sufficient condition for planar graphs with girth 5 to be (1,6)-colorable
- A note on Alon-Tarsi number of Halin graphs
- On two problems of defective choosability of graphs
- A sufficient condition for planar graphs with girth 5 to be (2, 4)-colorable
- Sparse critical graphs for defective (1, 3)-coloring
- An \((\mathcal{F}_2, \mathcal{F}_6)\)-partition of planar graphs without cycles of length 4 and 6
- On defective, multifold, online, list coloring of planar graphs via combinatorial nullstellensatz
- Defective and clustered colouring of graphs with given girth
- On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
- A \((3,1)^*\)-choosable theorem on toroidal graphs
- Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
- The relaxed game chromatic index of k-degenerate graphs
- The relaxed edge-coloring game and \(k\)-degenerate graphs
- Linear choosability of graphs
- Planar graphs are 1-relaxed, 4-choosable
This page was built for publication: List Improper Colourings of Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256694)
