The following pages link to (Q4838453):
Displaying 34 items.
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
- On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
- Approximation algorithms for time constrained scheduling (Q676776) (← links)
- Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
- Coloring problems on bipartite graphs of small diameter (Q831342) (← links)
- Coloring some classes of mixed graphs (Q858294) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- List edge multicoloring in graphs with few cycles (Q1029053) (← links)
- Precoloring extension. I: Interval graphs (Q1198648) (← links)
- Algorithmic complexity of list colorings (Q1327214) (← links)
- Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
- Generalized coloring for tree-like graphs (Q1363645) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- List coloring in the absence of a linear forest (Q2258070) (← links)
- The \(d\)-precoloring problem for \(k\)-degenerate graphs (Q2370443) (← links)
- On the complexity of restoring corrupted colorings (Q2424718) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- Hard coloring problems in low degree planar bipartite graphs (Q2506359) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete (Q2947029) (← links)
- 4‐Coloring <i>P</i> <sub>6</sub> ‐Free Graphs with No Induced 5‐Cycles (Q2978175) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs (Q3057613) (← links)
- Data Reduction for Graph Coloring Problems (Q3088272) (← links)
- Coloring Graphs without Short Cycles and Long Induced Paths (Q3088283) (← links)
- List Coloring in the Absence of a Linear Forest (Q3104770) (← links)
- (Q5075768) (← links)
- (Q5115779) (← links)
- Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
- On the complexity of coloring ‐graphs (Q6092550) (← links)
- List 3-coloring on comb-convex and caterpillar-convex bipartite graphs (Q6591467) (← links)
