Improper coloring of sparse graphs with a given girth. I: (0,1)-colorings of triangle-free graphs
From MaRDI portal
(Redirected from Publication:404440)
Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
Recommendations
- Improper coloring of sparse graphs with a given girth. II: Constructions
- 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
- On 1-improper 2-coloring of sparse graphs
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \(k\)
Cites work
- A Complexity Dichotomy for the Coloring of Sparse Graphs
- Globally sparse vertex‐ramsey graphs
- Improper coloring of sparse graphs with a given girth. II: Constructions
- Limits of near-coloring of sparse graphs
- Path partitions of planar graphs
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
Cited in
(27)- Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
- 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
- Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs
- On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree
- 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
- Maximum average degree and relaxed coloring
- Partitioning planar graph of girth 5 into two forests with maximum degree 4.
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \(k\)
- Path partitioning planar graphs with restrictions on short cycles
- On 1-improper 2-coloring of sparse graphs
- Defective Coloring on Classes of Perfect Graphs
- On 2-defective DP-colorings of sparse graphs
- An (F1,F4)‐partition of graphs with low genus and girth at least 6
- Parameterized (approximate) defective coloring
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs
- Parameterized (approximate) defective coloring
- Graph partitions under average degree constraint
- Improper coloring of sparse graphs with a given girth. II: Constructions
- Sparse critical graphs for defective DP-colorings
- Defective and clustered choosability of sparse graphs
- Colouring planar graphs with bounded monochromatic components
- Relaxed equitable colorings of planar graphs with girth at least 8
- Defective DP-colorings of sparse multigraphs
- Defective DP-colorings of sparse simple graphs
This page was built for publication: Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404440)
