scientific article; zbMATH DE number 1250667
From MaRDI portal
Publication:4230860
zbMath0916.05026MaRDI QIDQ4230860
No author found.
Publication date: 19 July 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (65)
A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable ⋮ Every planar graph with girth at least 5 is \((1,9)\)-colorable ⋮ \((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles ⋮ Path choosability of planar graphs ⋮ Fashion game on planar graphs ⋮ Defective 2-colorings of planar graphs without 4-cycles and 5-cycles ⋮ A \((3,1)^\ast\)-choosable theorem on planar graphs ⋮ Improper choosability of graphs of nonnegative characteristic ⋮ Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable ⋮ Every planar graph is 1-defective \((9,2)\)-paintable ⋮ Improper Choosability and Property B ⋮ The relaxed game chromatic index of \(k\)-degenerate graphs ⋮ Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable ⋮ The relaxed edge-coloring game and \(k\)-degenerate graphs ⋮ On the computational complexity of the bipartizing matching problem ⋮ Decomposing planar graphs into graphs with degree restrictions ⋮ Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable ⋮ A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles ⋮ \((k,1)\)-coloring of sparse graphs ⋮ \((k,j)\)-coloring of sparse graphs ⋮ Improper choosability of graphs embedded on the surface of genus \(r\) ⋮ Decomposition of toroidal graphs without some subgraphs ⋮ Weak (2, 3)-decomposition of planar graphs ⋮ Sparse critical graphs for defective DP-colorings ⋮ The Alon-Tarsi number of a planar graph minus a matching ⋮ Decomposition of planar graphs with forbidden configurations ⋮ Improper colorability of planar graphs without prescribed short cycles ⋮ (1,k)-Coloring of Graphs with Girth at Least Five on a Surface ⋮ Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable ⋮ Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ A simple competitive graph coloring algorithm. II. ⋮ On 2-defective DP-colorings of sparse graphs ⋮ Defective DP-colorings of sparse multigraphs ⋮ 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 ⋮ List strong linear 2-arboricity of sparse graphs ⋮ On improperly chromatic-choosable graphs ⋮ Defective DP-colorings of sparse simple graphs ⋮ Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable ⋮ Defective 3-paintability of planar graphs ⋮ Improper colouring of (random) unit disk graphs ⋮ Sufficient conditions on planar graphs to have a relaxed DP-3-coloring ⋮ Good edge-labelling of graphs ⋮ Near-colorings: non-colorable graphs and NP-completeness ⋮ Acyclic improper choosability of subcubic graphs ⋮ A note on list improper coloring planar graphs ⋮ Planar graphs are 1-relaxed, 4-choosable ⋮ Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k ⋮ Improper coloring of unit disk graphs ⋮ Good edge-labelling of graphs ⋮ Locally planar graphs are 2-defective 4-paintable ⋮ A note on list improper coloring of plane graphs ⋮ On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles ⋮ Relaxed equitable colorings of planar graphs with girth at least 8 ⋮ The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\) ⋮ Defective and clustered choosability of sparse graphs ⋮ Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths ⋮ A \((3,1)^*\)-choosable theorem on toroidal graphs ⋮ The Alon-Tarsi number of \(K_5\)-minor-free graphs ⋮ Planar graphs with girth at least 5 are \((3, 4)\)-colorable ⋮ (3, 1)-choosability of toroidal graphs with some forbidden short cycles ⋮ Improper Colourings of Unit Disk Graphs ⋮ Acyclic improper choosability of graphs ⋮ Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles ⋮ Limits of Near-Coloring of Sparse Graphs
This page was built for publication:
