Pages that link to "Item:Q1198648"

The following pages link to Precoloring extension. I: Interval graphs (Q1198648):

Displaying 50 items.

• Problems on cycles and colorings (Q383772) (← links)
• Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
• The complexity of changing colourings with bounded maximum degree (Q407523) (← links)
• Colouring, constraint satisfaction, and complexity (Q458466) (← links)
• Flow polynomials as Feynman amplitudes and their \(\alpha\)-representation (Q510320) (← links)
• Using local search to speed up filtering algorithms for some NP-hard constraints (Q545546) (← links)
• Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines (Q600836) (← 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)
• A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding (Q869001) (← links)
• Distance constraints in graph color extensions (Q885289) (← links)
• Aliased register allocation for straight-line programs is NP-complete (Q954999) (← links)
• Precoloring extension of co-Meyniel graphs (Q995757) (← links)
• Complexity results for minimum sum edge coloring (Q1028432) (← links)
• Precoloring extension for 2-connected graphs with maximum degree three (Q1044924) (← links)
• You can't paint yourself into a corner (Q1272489) (← links)
• The combinatorics of timetabling (Q1278524) (← links)
• Algorithmic complexity of list colorings (Q1327214) (← links)
• Periodic assignment and graph colouring (Q1329789) (← links)
• Scheduling with incompatible jobs (Q1343141) (← links)
• Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
• Generalized coloring for tree-like graphs (Q1363645) (← links)
• Preassignment requirements in chromatic scheduling (Q1363744) (← links)
• Extending graph colorings (Q1569052) (← links)
• Complexity of choosing subsets from color sets (Q1584428) (← 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)
• Elimination of parallel copies using code motion on data dependence graphs (Q1649320) (← links)
• A branch-and-check approach for a wind turbine maintenance scheduling problem (Q1651530) (← links)
• Combinatorial problems on \(H\)-graphs (Q1689915) (← links)
• Polyhedral studies of vertex coloring problems: the standard formulation (Q1751160) (← links)
• Batch coloring of graphs (Q1755745) (← links)
• Uncolorable mixed hypergraphs (Q1962044) (← links)
• On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
• Matroids arising from electrical networks (Q2122763) (← links)
• Isomorphism testing for \(T\)-graphs in FPT (Q2154101) (← links)
• On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
• Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
• Electrical networks and hyperplane arrangements (Q2326914) (← links)
• The \(d\)-precoloring problem for \(k\)-degenerate graphs (Q2370443) (← links)
• Routing equal-size messages on a slotted ring (Q2434298) (← links)
• Precoloring extension on unit interval graphs (Q2492199) (← links)
• Hard coloring problems in low degree planar bipartite graphs (Q2506359) (← links)
• Efficient isomorphism for \(S_d\)-graphs and \(T\)-graphs (Q2684481) (← links)
• Invited talks (Q2692717) (← links)
• A technique for exact computation of precoloring extension on interval graphs (Q2841989) (← links)
• On inverse chromatic number problems (extended abstract) (Q2861543) (← links)
• Algorithmic Applications of Tree-Cut Width (Q2946405) (← links)