Defective coloring revisited
From MaRDI portal
Publication:3122895
DOI<205::AID-JGT2>3.0.CO;2-T 10.1002/(SICI)1097-0118(199703)24:3<205::AID-JGT2>3.0.CO;2-TzbMath0877.05019OpenAlexW2032265004MaRDI QIDQ3122895
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<205::aid-jgt2>3.0.co;2-t
Related Items (52)
Defective colorings on k-uniform hypergraphs ⋮ Clustered colouring of graph classes with bounded treedepth or pathwidth ⋮ Finding good 2-partitions of digraphs. II. Enumerable properties ⋮ Unnamed Item ⋮ A Relative of Hadwiger's Conjecture ⋮ Colorings of plane graphs without long monochromatic facial paths ⋮ Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations ⋮ Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable ⋮ Coloring subgraphs with restricted amounts of hues ⋮ The relaxed game chromatic index of \(k\)-degenerate graphs ⋮ Partitions of graphs into cographs ⋮ The relaxed edge-coloring game and \(k\)-degenerate graphs ⋮ Weighted improper colouring ⋮ On the computational complexity of the bipartizing matching problem ⋮ Degree-constrained 2-partitions of graphs ⋮ Parameterized (Approximate) Defective Coloring ⋮ Graph partitions under average degree constraint ⋮ Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable ⋮ Subcolorings and the subchromatic number of a graph ⋮ Some defective parameters in graphs ⋮ Information-sharing in social networks ⋮ Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes ⋮ A simple competitive graph coloring algorithm. II. ⋮ Fashion game on graphs ⋮ On generalized choice and coloring numbers ⋮ On t-relaxed chromatic number of r-power paths ⋮ Co-2-plex vertex partitions ⋮ The t-Improper Chromatic Number of Random Graphs ⋮ Pairwise-Interaction Games ⋮ On the complexity of generalized chromatic polynomials ⋮ Advances on defective parameters in graphs ⋮ WORM colorings of planar graphs ⋮ Improper colouring of (random) unit disk graphs ⋮ Directed weighted improper coloring for cellular channel allocation ⋮ Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph ⋮ Improper coloring of unit disk graphs ⋮ Vertex-Coloring with Star-Defects ⋮ Chromatic sums for colorings avoiding monochromatic subgraphs ⋮ Bounds and fixed-parameter algorithms for weighted improper coloring ⋮ On \(t\)-relaxed 2-distant circular coloring of graphs ⋮ Relaxed equitable colorings of planar graphs with girth at least 8 ⋮ Improper colouring of graphs with no odd clique minor ⋮ Defective and clustered choosability of sparse graphs ⋮ Channel assignment problem and relaxed 2-distant coloring of graphs ⋮ Equitable defective coloring of sparse planar graphs ⋮ Unnamed Item ⋮ Graph coloring with cardinality constraints on the neighborhoods ⋮ Some of My Favorite Coloring Problems for Graphs and Digraphs ⋮ Defective Coloring on Classes of Perfect Graphs ⋮ Improper Colourings of Unit Disk Graphs ⋮ Acyclic improper choosability of graphs ⋮ An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
This page was built for publication: Defective coloring revisited
