Pages that link to "Item:Q730005"

The following pages link to Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete (Q730005):

Displaying 3 items.

• A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length (Q528481) (← links)
• Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
• Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT (Q2632009) (← links)