Defective coloring revisited
From MaRDI portal
Publication:3122895
Recommendations
Cited in
(62)- Some of my favorite coloring problems for graphs and digraphs
- Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets
- Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph
- Introduction to competitive graph coloring
- On \(t\)-relaxed chromatic number of \(r\)-power paths
- Graph partitions under average degree constraint
- A simple competitive graph coloring algorithm. II.
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
- The \(t\)-improper chromatic number of random graphs
- Relaxed equitable colorings of planar graphs with girth at least 8
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
- Fashion game on planar graphs
- On generalized choice and coloring numbers
- Graph coloring with cardinality constraints on the neighborhoods
- On \(t\)-relaxed 2-distant circular coloring of graphs
- On the computational complexity of the bipartizing matching problem
- Parameterized (approximate) defective coloring
- Improper colouring of (random) unit disk graphs
- Weighted improper colouring
- Defective Coloring on Classes of Perfect Graphs
- Degree-constrained 2-partitions of graphs
- Equitable defective coloring of sparse planar graphs
- Chromatic sums for colorings avoiding monochromatic subgraphs
- Some defective parameters in graphs
- Pairwise-interaction games
- Acyclic improper choosability of graphs
- Parameterized (approximate) defective coloring
- The relaxed game chromatic index of \(k\)-degenerate graphs
- Channel assignment problem and relaxed 2-distant coloring of graphs
- The relaxed edge-coloring game and \(k\)-degenerate graphs
- On the complexity of generalized chromatic polynomials
- Bounds and fixed-parameter algorithms for weighted improper coloring
- Clustered colouring of graph classes with bounded treedepth or pathwidth
- Partitions of graphs into cographs
- The number of defective colorings of graphs on surfaces
- Vertex-coloring with defects
- scientific article; zbMATH DE number 1833073 (Why is no real title available?)
- Vertex-coloring with star-defects
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
- Coloring subgraphs with restricted amounts of hues
- Colorings of plane graphs without long monochromatic facial paths
- Further consequences of the colorful Helly hypothesis
- Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable
- Finding good 2-partitions of digraphs. II. Enumerable properties
- Improper Colourings of Unit Disk Graphs
- Defective colouring of graphs excluding a subgraph or minor
- Information-sharing in social networks
- Fashion game on graphs
- Improper coloring of unit disk graphs
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- WORM colorings of planar graphs
- Co-2-plex vertex partitions
- A relative of Hadwiger's conjecture
- Subcolorings and the subchromatic number of a graph
- Improper colouring of graphs with no odd clique minor
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
- Locally planar graphs are 2-defective 4-paintable
- Defective colorings on \(k\)-uniform hypergraphs
- Advances on defective parameters in graphs
- scientific article; zbMATH DE number 2230325 (Why is no real title available?)
- Defective and clustered choosability of sparse graphs
- Directed weighted improper coloring for cellular channel allocation
This page was built for publication: Defective coloring revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3122895)
