Pages that link to "Item:Q3656856"

The following pages link to What Makes Equitable Connected Partition Easy (Q3656856):

Displaying 10 items.

• On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
• On the parameterized complexity of some optimization problems related to multiple-interval graphs (Q606990) (← links)
• Finding vertex-surjective graph homomorphisms (Q715053) (← links)
• The parameterised complexity of computing the maximum modularity of a graph (Q786031) (← links)
• (Q5009471) (← links)
• (Q5874480) (← links)
• Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887) (← links)
• Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)
• Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191) (← links)
• Extended MSO model checking via small vertex integrity (Q6185940) (← links)