Pages that link to "Item:Q1678166"

The following pages link to Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166):

Displaying 4 items.

• Monopolar graphs: complexity of computing classical graph parameters (Q2659081) (← links)
• (Q5009615) (← links)
• Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)
• Minimization and parameterized variants of vertex partition problems on graphs (Q6087212) (← links)