Pages that link to "Item:Q2272594"

The following pages link to Optimal data reduction for graph coloring using low-degree polynomials (Q2272594):

Displaying 5 items.

• Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
• Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
• Parameterized Complexity of Conflict-Free Graph Coloring (Q4959657) (← links)
• Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
• (Q6065467) (← links)