Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
From MaRDI portal
Publication:3728016
DOI10.1002/JGT.3190100207zbMATH Open0596.05024OpenAlexW2009827511MaRDI QIDQ3728016FDOQ3728016
Author name not available (Why is that?)
Publication date: 1986
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190100207
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cited In (only showing first 100 items - show all)
- 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
- Vertex coloring edge-weighted digraphs
- The t-Improper Chromatic Number of Random Graphs
- The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
- Deciding Relaxed Two-Colourability: A Hardness Jump
- Regular independent sets
- Subcolorings and the subchromatic number of a graph
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
- Near-colorings: non-colorable graphs and NP-completeness
- Improper colouring of (random) unit disk graphs
- Acyclic colorings of planar graphs
- On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number
- Improper C-colorings of graphs
- Weighted improper colouring
- Improper coloring of unit disk graphs
- Title not available (Why is that?)
- \((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles
- Planar Ramsey graphs
- On the computational complexity of the bipartizing matching problem
- 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
- A \((3,1)^*\)-choosable theorem on toroidal graphs
- On 1-improper 2-coloring of sparse graphs
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
- Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable
- Planar graphs are 1-relaxed, 4-choosable
- Coloring complexes and combinatorial Hopf monoids
- The Alon-Tarsi number of a planar graph minus a matching
- On 2-defective DP-colorings of sparse graphs
- Acyclic improper choosability of graphs
- The relaxed edge-coloring game and \(k\)-degenerate graphs
- Bounds and fixed-parameter algorithms for weighted improper coloring
- The t-improper chromatic number of random graphs
- Distributed deterministic edge coloring using bounded neighborhood independence
- Surfaces, tree-width, clique-minors, and partitions
- Defective 2-colorings of sparse graphs
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
- A \((3,1)^\ast\)-choosable theorem on planar graphs
- The relaxed game chromatic index of \(k\)-degenerate graphs
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
- List strong linear 2-arboricity of sparse graphs
- Equitable defective coloring of sparse planar graphs
- On \(S\)-packing edge-colorings of cubic graphs
- A simple competitive graph coloring algorithm. II.
- Limits of near-coloring of sparse graphs
- Planar graphs with girth at least 5 are \((3, 5)\)-colorable
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
- Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable
- 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
- A simple competitive graph coloring algorithm. III
- (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
- Improper Choosability and Property B
- A note on relaxed equitable coloring of graphs
- Globally sparse vertex‐ramsey graphs
- On improperly chromatic-choosable graphs
- \((1,0,0)\)-colorability of planar graphs without prescribed short cycles
- Co-2-plex vertex partitions
- A note on defective colorings of graphs in surfaces
- Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths
- \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)
- Partitions of graphs into cographs
- Vertex-Coloring with Star-Defects
- 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
- Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
- Parameterized (Approximate) Defective Coloring
- The number of defective colorings of graphs on surfaces
- 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable
- Not all planar graphs are in PURE-4-DIR
- Every planar graph is 1-defective \((9,2)\)-paintable
- On (s,t)-relaxed L(1,1)-labelling of trees
- Vertex partitioning problems on graphs with bounded tree width
- Locally planar graphs are 2-defective 4-paintable
- On generalized choice and coloring numbers
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
- Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
- Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
- Title not available (Why is that?)
- Improper Colourings of Unit Disk Graphs
- Sufficient conditions on planar graphs to have a relaxed DP-3-coloring
- Splitting a planar graph of girth 5 into two forests with trees of small diameter
- On the minimal reducible bound for outerplanar and planar 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
- Acyclic improper choosability of subcubic graphs
- On t-relaxed chromatic number of r-power paths
- Path choosability of planar graphs
- Defective 3-paintability of planar graphs
- Defective colorings on k-uniform hypergraphs
- Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
- Introduction to competitive graph coloring
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)
