The following pages link to Defective coloring revisited (Q3122895):
Displaying 42 items.
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- Co-2-plex vertex partitions (Q498448) (← links)
- WORM colorings of planar graphs (Q521753) (← links)
- Partitions of graphs into cographs (Q607000) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Bounds and fixed-parameter algorithms for weighted improper coloring (Q737104) (← links)
- Equitable defective coloring of sparse planar graphs (Q764883) (← links)
- The relaxed game chromatic index of \(k\)-degenerate graphs (Q879391) (← links)
- The relaxed edge-coloring game and \(k\)-degenerate graphs (Q890010) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- Subcolorings and the subchromatic number of a graph (Q1412662) (← links)
- A simple competitive graph coloring algorithm. II. (Q1425110) (← links)
- On generalized choice and coloring numbers (Q1733934) (← links)
- Advances on defective parameters in graphs (Q1751109) (← links)
- Weighted improper colouring (Q1932354) (← links)
- Some defective parameters in graphs (Q1950405) (← links)
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
- On \(t\)-relaxed 2-distant circular coloring of graphs (Q2045235) (← links)
- Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590) (← links)
- Fashion game on graphs (Q2218646) (← links)
- Directed weighted improper coloring for cellular channel allocation (Q2255043) (← links)
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084) (← links)
- Relaxed equitable colorings of planar graphs with girth at least 8 (Q2305904) (← links)
- Channel assignment problem and relaxed 2-distant coloring of graphs (Q2306601) (← links)
- Coloring subgraphs with restricted amounts of hues (Q2406596) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306) (← links)
- Information-sharing in social networks (Q2437849) (← links)
- Improper colouring of (random) unit disk graphs (Q2476286) (← links)
- Chromatic sums for colorings avoiding monochromatic subgraphs (Q2516680) (← links)
- Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
- Colorings of plane graphs without long monochromatic facial paths (Q2656334) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Vertex-Coloring with Star-Defects (Q2803807) (← links)
- Pairwise-Interaction Games (Q3012801) (← links)
- Improper coloring of unit disk graphs (Q3057115) (← links)
- (Q3304104) (← links)
- Improper Colourings of Unit Disk Graphs (Q3439320) (← links)
- Acyclic improper choosability of graphs (Q3439591) (← links)
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem (Q5136236) (← links)
- Defective Coloring on Classes of Perfect Graphs (Q5864723) (← links)
- Graph partitions under average degree constraint (Q6187347) (← links)
