On 1-improper 2-coloring of sparse graphs
From MaRDI portal
Recommendations
- Improper coloring of sparse graphs with a given girth. II: Constructions
- Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
- Near-proper vertex 2-colorings of sparse graphs
- \((k,1)\)-coloring of sparse graphs
- Defective 2-colorings of sparse graphs
- On 2-defective DP-colorings of sparse graphs
- 2-distance coloring of sparse graphs
- 2-distance coloring of sparse graphs
- A Complexity Dichotomy for the Coloring of Sparse Graphs
Cites work
- scientific article; zbMATH DE number 3838073 (Why is no real title available?)
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 3563170 (Why is no real title available?)
- scientific article; zbMATH DE number 3228454 (Why is no real title available?)
- scientific article; zbMATH DE number 3243267 (Why is no real title available?)
- Defective 2-colorings of sparse graphs
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Globally sparse vertex‐ramsey graphs
- Improper choosability of graphs and maximum average degree
- List strong linear 2-arboricity of sparse graphs
- Near-proper vertex 2-colorings of sparse graphs
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Path partitions of planar graphs
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \(k\)
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
- \((k,1)\)-coloring of sparse graphs
- \((k,j)\)-coloring of sparse graphs
Cited in
(35)- Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
- \((k,1)\)-coloring of sparse graphs
- Path partition of planar graphs with girth at least six
- 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
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
- Note on improper coloring of 1-planar graphs.
- Path partitioning planar graphs of girth 4 without adjacent short cycles
- Splitting a planar graph of girth 5 into two forests with trees of small diameter
- Vertex partitions into an independent set and a forest with each component small
- Maximum average degree and relaxed coloring
- Splitting planar graphs of girth 6 into two linear forests with short paths
- On the computational complexity of the bipartizing matching problem
- Path partitioning planar graphs with restrictions on short cycles
- I,F-partitions of sparse graphs
- Near-proper vertex 2-colorings of sparse graphs
- Defective Coloring on Classes of Perfect Graphs
- Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets
- On 2-defective DP-colorings of sparse graphs
- Parameterized (approximate) defective coloring
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs
- Parameterized (approximate) defective coloring
- Planar graphs with girth at least 5 are \((3, 4)\)-colorable
- Graph partitions under average degree constraint
- Improper coloring of sparse graphs with a given girth. II: Constructions
- Colorings of plane graphs without long monochromatic facial paths
- Sparse critical graphs for defective DP-colorings
- Planar graphs with girth at least 5 are \((3, 5)\)-colorable
- Defective and clustered choosability of sparse graphs
- (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
- Colouring planar graphs with bounded monochromatic components
- Defective DP-colorings of sparse multigraphs
- Defective DP-colorings of sparse simple graphs
- WORM colorings of planar graphs
- Partitioning sparse graphs into an independent set and a graph with bounded size components
This page was built for publication: On 1-improper 2-coloring of sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393935)
