Pages that link to "Item:Q2492199"

The following pages link to Precoloring extension on unit interval graphs (Q2492199):

Displaying 17 items.

• Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
• Canonical antichains of unit interval and bipartite permutation graphs (Q651422) (← links)
• Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
• Parameterized coloring problems on chordal graphs (Q820152) (← links)
• Precoloring extension. I: Interval graphs (Q1198648) (← links)
• On residual approximation in solution extension problems (Q1631675) (← links)
• Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← 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)
• On Residual Approximation in Solution Extension Problems (Q2958338) (← links)
• Conference Program Design with Single-Peaked and Single-Crossing Preferences (Q2959832) (← links)
• On coloring problems with local constraints (Q5891606) (← links)
• Exploring the complexity boundary between coloring and list-coloring (Q5896984) (← links)
• Flexible list colorings in graphs with special degeneracy conditions (Q6046649) (← links)
• Flexible List Colorings in Graphs with Special Degeneracy Conditions (Q6065433) (← links)
• On the parameterized complexity of interval scheduling with eligible machine sets (Q6564614) (← links)
• Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms (Q6611071) (← links)