Pages that link to "Item:Q266810"

The following pages link to On the minimum and maximum selective graph coloring problems in some graph classes (Q266810):

Displaying 8 items.

• An exact algorithm for the partition coloring problem (Q1651600) (← links)
• Perfectness of clustered graphs (Q1799385) (← links)
• Uncertain vertex coloring problem (Q2001167) (← links)
• An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
• A note on selective line-graphs and partition colorings (Q2294381) (← links)
• On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)
• On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
• On some applications of the selective graph coloring problem (Q2629634) (← links)