Pages that link to "Item:Q2490257"

The following pages link to Non-zero disjoint cycles in highly connected group labelled graphs (Q2490257):

Displaying 16 items.

• On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
• FPT algorithms for path-transversal and cycle-transversal problems (Q456698) (← links)
• Packing cycles with modularity constraints (Q653988) (← links)
• On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture (Q858685) (← links)
• The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces (Q868342) (← links)
• Finding a path with two labels forbidden in group-labeled graphs (Q2173429) (← links)
• Synchronization problems in computer vision with closed-form solutions (Q2193841) (← links)
• Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
• Half-integrality, LP-branching, and FPT Algorithms (Q2816829) (← links)
• Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs (Q2827821) (← links)
• A Faster Parameterized Algorithm for Group Feedback Edge Set (Q3181064) (← links)
• Erdös-Pósa Property of Obstructions to Interval Graphs (Q3304101) (← links)
• Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs (Q4978443) (← links)
• Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
• Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs (Q5346553) (← links)
• Erdős–Pósa property of obstructions to interval graphs (Q6094044) (← links)