Pages that link to "Item:Q2490257"
From MaRDI portal
The following pages link to Non-zero disjoint cycles in highly connected group labelled graphs (Q2490257):
Displayed 4 items.
- 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)