Pages that link to "Item:Q2424801"

The following pages link to Optimal channel assignment with list-edge coloring (Q2424801):

Displaying 1 item.

• The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)