Pages that link to "Item:Q1186161"

The following pages link to Some results concerning the complexity of restricted colorings of graphs (Q1186161):

Displaying 16 items.

• Consensus models: computational complexity aspects in modern approaches to the list coloring problem (Q638544) (← links)
• Approximating the max-edge-coloring problem (Q986540) (← links)
• List homomorphisms to reflexive graphs (Q1127870) (← links)
• A graph colouring model for assigning a heterogeneous workforce to a given schedule (Q1266545) (← links)
• Extensions of coloring models for scheduling purposes (Q1268282) (← links)
• Interval edge coloring of a graph with forbidden colors (Q1309462) (← links)
• Restricted coloring models for timetabling (Q1356739) (← links)
• Preassignment requirements in chromatic scheduling (Q1363744) (← links)
• Open shop problem with zero-one time operations and integer release date/deadline intervals (Q1363753) (← links)
• Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
• Restrictions and preassignments in preemptive open shop scheduling (Q1917354) (← links)
• Improved approximation algorithms for the max edge-coloring problem (Q1944142) (← links)
• On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
• Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
• On the Maximum Edge Coloring Problem (Q3602848) (← links)
• Solving Graph Partitioning Problems with Parallel Metaheuristics (Q4609771) (← links)