Defective coloring revisited
From MaRDI portal
Publication:3122895
DOI10.1002/(SICI)1097-0118(199703)24:3%3C205::AID-JGT2%3E3.0.CO;2-TzbMATH Open0877.05019OpenAlexW2032265004MaRDI QIDQ3122895FDOQ3122895
Wayne Goddard, Caroline Esther Jesurum, Lenore J. Cowen
Publication date: 16 November 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199703)24:3%3C205::aid-jgt2%3E3.0.co;2-t
Recommendations
Cited In (57)
- Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph
- Introduction to competitive graph coloring
- Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets
- Graph partitions under average degree constraint
- Some of My Favorite Coloring Problems for Graphs and Digraphs
- The t-Improper Chromatic Number of Random Graphs
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
- Parameterized (Approximate) Defective Coloring
- Pairwise-Interaction Games
- Information-sharing in social networks
- Subcolorings and the subchromatic number of a graph
- Improper colouring of (random) unit disk graphs
- Clustered colouring of graph classes with bounded treedepth or pathwidth
- On generalized choice and coloring numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improper Colourings of Unit Disk Graphs
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- Weighted improper colouring
- Improper coloring of unit disk graphs
- Title not available (Why is that?)
- On t-relaxed chromatic number of r-power paths
- On the computational complexity of the bipartizing matching problem
- Advances on defective parameters in graphs
- Defective colorings on k-uniform hypergraphs
- Defective Coloring on Classes of Perfect Graphs
- Some defective parameters in graphs
- Degree-constrained 2-partitions of graphs
- Fashion game on graphs
- Acyclic improper choosability of graphs
- The relaxed edge-coloring game and \(k\)-degenerate graphs
- Bounds and fixed-parameter algorithms for weighted improper coloring
- Coloring subgraphs with restricted amounts of hues
- On \(t\)-relaxed 2-distant circular coloring of graphs
- The relaxed game chromatic index of \(k\)-degenerate graphs
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
- Channel assignment problem and relaxed 2-distant coloring of graphs
- Equitable defective coloring of sparse planar graphs
- Colorings of plane graphs without long monochromatic facial paths
- A simple competitive graph coloring algorithm. II.
- Chromatic sums for colorings avoiding monochromatic subgraphs
- Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable
- Improper colouring of graphs with no odd clique minor
- Defective and clustered choosability of sparse graphs
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
- Directed weighted improper coloring for cellular channel allocation
- Co-2-plex vertex partitions
- Partitions of graphs into cographs
- A Relative of Hadwiger's Conjecture
- Finding good 2-partitions of digraphs. II. Enumerable properties
- Vertex-Coloring with Star-Defects
- Relaxed equitable colorings of planar graphs with girth at least 8
- Graph coloring with cardinality constraints on the neighborhoods
- Further consequences of the colorful Helly hypothesis
- WORM colorings of planar graphs
- On the complexity of generalized chromatic polynomials
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)
