The following pages link to (Q3744180):
Displaying 16 items.
- Bounds and fixed-parameter algorithms for weighted improper coloring (Q737104) (← links)
- Local coloring of Kneser graphs (Q998322) (← links)
- Bounded families for the on-line \(t\)-relaxed coloring (Q1044722) (← links)
- Extremal results on defective colorings of graphs (Q1318803) (← links)
- Conditional chromatic numbers with forbidden cycles (Q1805306) (← links)
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
- Degree tolerant coloring of graph (Q2061289) (← links)
- Improper interval edge colorings of graphs (Q2235270) (← links)
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable (Q2434306) (← links)
- Improper colouring of (random) unit disk graphs (Q2476286) (← links)
- Chromatic sums for colorings avoiding monochromatic subgraphs (Q2516680) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Vertex-Coloring with Star-Defects (Q2803807) (← links)
- The t-improper chromatic number of random graphs (Q3503499) (← links)
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem (Q5136236) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)