The following pages link to (Q4838466):
Displaying 39 items.
- Problems on cycles and colorings (Q383772) (← links)
- The complexity of changing colourings with bounded maximum degree (Q407523) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Some good characterization results relating to the Kőnig-Egerváry theorem (Q623797) (← links)
- Approximation algorithms for time constrained scheduling (Q676776) (← links)
- Parameterized coloring problems on chordal graphs (Q820152) (← links)
- Coloring some classes of mixed graphs (Q858294) (← links)
- Distance constraints in graph color extensions (Q885289) (← links)
- Precoloring extension of co-Meyniel graphs (Q995757) (← links)
- Complexity results for minimum sum edge coloring (Q1028432) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Precoloring extension for 2-connected graphs with maximum degree three (Q1044924) (← links)
- Precoloring extension. I: Interval graphs (Q1198648) (← links)
- You can't paint yourself into a corner (Q1272489) (← links)
- Algorithmic complexity of list colorings (Q1327214) (← links)
- Scheduling with incompatible jobs (Q1343141) (← links)
- Generalized coloring for tree-like graphs (Q1363645) (← links)
- Preassignment requirements in chromatic scheduling (Q1363744) (← links)
- Extending graph colorings (Q1569052) (← links)
- On the number of precolouring extensions (Q1590211) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- Extending partial representations of subclasses of chordal graphs (Q2344737) (← links)
- The \(d\)-precoloring problem for \(k\)-degenerate graphs (Q2370443) (← links)
- On two coloring problems in mixed graphs (Q2426450) (← links)
- Precoloring extension on unit interval graphs (Q2492199) (← links)
- Hard coloring problems in low degree planar bipartite graphs (Q2506359) (← links)
- Precoloring extension involving pairs of vertices of small distance (Q2636808) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- On Residual Approximation in Solution Extension Problems (Q2958338) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Precoloring Extension for 2‐connected Graphs (Q5454276) (← links)
- On coloring problems with local constraints (Q5891093) (← links)
- On coloring problems with local constraints (Q5891606) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5896984) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5899384) (← links)
- On the complexity of coloring ‐graphs (Q6092550) (← links)
