Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
From MaRDI portal
Publication:3728016
Recommendations
Cited in
(only showing first 100 items - show all)- Chromatic sums for colorings avoiding monochromatic subgraphs
- Every planar graph with girth at least 5 is (1,9)-colorable
- Planar graphs with girth at least 5 are \((3, 5)\)-colorable
- Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable
- Limits of near-coloring of sparse graphs
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
- Degree tolerant coloring of graph
- Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable
- Defective and clustered choosability of sparse graphs
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
- Bounded families for the on-line \(t\)-relaxed coloring
- Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
- On \(t\)-relaxed chromatic number of \(r\)-power paths
- Defective colorings on \(k\)-uniform hypergraphs
- A simple competitive graph coloring algorithm. III
- A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles
- (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
- Chromatic quasisymmetric class functions for combinatorial Hopf monoids
- On two problems of defective choosability of graphs
- Colouring planar graphs with bounded monochromatic components
- New restrictions on defective coloring with applications to Steinberg-type graphs
- On improperly chromatic-choosable graphs
- A note on relaxed equitable coloring of graphs
- \((1,0,0)\)-colorability of planar graphs without prescribed short cycles
- Co-2-plex vertex partitions
- A relaxation of Novosibirsk 3-color conjecture
- Globally sparse vertex‐ramsey graphs
- Partitions of graphs into cographs
- A note on defective colorings of graphs in surfaces
- \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)
- Decomposition of planar graphs with forbidden configurations
- Relaxed equitable colorings of planar graphs with girth at least 8
- Parameterized complexity of fair vertex evaluation problems
- Monochromatic graph decompositions inspired by anti-Ramsey colorings
- Defective DP-colorings of sparse multigraphs
- Defective DP-colorings of sparse simple graphs
- Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable
- Improper colorability of planar graphs without prescribed short cycles
- \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9
- Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
- (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6
- \((k,1)\)-coloring of sparse graphs
- \((k,j)\)-coloring of sparse graphs
- Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable
- Vertex coloring edge-weighted digraphs
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
- Regular independent sets
- Fractional, circular, and defective coloring of series-parallel graphs
- The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
- Subcolorings and the subchromatic number of a graph
- The number of defective colorings of graphs on surfaces
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
- Some of my favorite coloring problems for graphs and digraphs
- Every planar graph is 1-defective \((9,2)\)-paintable
- Acyclic colorings of planar graphs
- Deciding Relaxed Two-Colourability: A Hardness Jump
- Near-colorings: non-colorable graphs and NP-completeness
- Not all planar graphs are in PURE-4-DIR
- Improper colouring of (random) unit disk graphs
- 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable
- Vertex partitioning problems on graphs with bounded tree width
- On generalized choice and coloring numbers
- Improper choosability and property B
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
- On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number
- Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
- Locally planar graphs are 2-defective 4-paintable
- Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
- Improper coloring of graphs on surfaces
- Improper C-colorings of graphs
- Improper Colourings of Unit Disk Graphs
- Sufficient conditions on planar graphs to have a relaxed DP-3-coloring
- Weighted improper colouring
- Splitting a planar graph of girth 5 into two forests with trees of small diameter
- (3, 1)^*-choosability of graphs of nonnegative characteristic without intersecting short cycles
- Improper coloring of unit disk graphs
- On the minimal reducible bound for outerplanar and planar graphs
- scientific article; zbMATH DE number 2230325 (Why is no real title available?)
- Acyclic improper choosability of subcubic graphs
- Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph
- 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
- Splitting planar graphs of girth 6 into two linear forests with short paths
- Planar Ramsey graphs
- Path choosability of planar graphs
- On the computational complexity of the bipartizing matching problem
- Defective 3-paintability of planar graphs
- Extremal results on defective colorings of graphs
- On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
- Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable
- Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
- A \((3,1)^*\)-choosable theorem on toroidal graphs
- Dynamic \(F\)-free coloring of graphs
- Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
- On 1-improper 2-coloring of sparse graphs
- Some defective parameters in graphs
- Introduction to competitive graph coloring
- Monochromatic subgraphs in iterated triangulations
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
This page was built for publication: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3728016)
