Pages that link to "Item:Q408371"

The following pages link to A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371):

Displaying 1 item.

• Polyhedral studies of vertex coloring problems: the standard formulation (Q1751160) (← links)