The following pages link to Mangoes and blueberries (Q1125684):
Displaying 38 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- Rooted grid minors (Q345092) (← links)
- Packing cycles with modularity constraints (Q653988) (← links)
- Finding odd cycle transversals. (Q703225) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Graphs without two vertex-disjoint \(S\)-cycles (Q785795) (← links)
- The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces (Q868342) (← links)
- Approximate min-max relations for odd cycles in planar graphs (Q877199) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- Edge-disjoint odd cycles in planar graphs. (Q1425111) (← links)
- On the strong and the semi-strong path partition conjecture (Q1985941) (← links)
- Frustration-critical signed graphs (Q2081482) (← links)
- Erdős-Pósa property of chordless cycles and its applications (Q2200918) (← links)
- Half-integral packing of odd cycles through prescribed vertices (Q2259381) (← links)
- Revisiting a theorem by Folkman on graph colouring (Q2309226) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
- The computational complexity of three graph problems for instances with bounded minors of constraint matrices (Q2357129) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Planar graph bipartization in linear time (Q2482113) (← links)
- Non-zero disjoint cycles in highly connected group labelled graphs (Q2490257) (← links)
- Monotone maps, sphericity and bounded second eigenvalue (Q2573647) (← links)
- Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs (Q2827821) (← links)
- Erdös-Pósa Property of Obstructions to Interval Graphs (Q3304101) (← links)
- Non-zero disjoint cycles in highly connected group labeled graphs (Q3439347) (← 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)
- (Q5743513) (← links)
- Chordless Cycle Packing Is Fixed-Parameter Tractable (Q5874543) (← links)
- (Q5884490) (← links)
- Packing and covering odd cycles in cubic plane graphs with small faces (Q5915831) (← links)
- Packing and covering odd cycles in cubic plane graphs with small faces (Q5920132) (← links)
- Packing cycles in undirected group-labelled graphs (Q6038589) (← links)
- Erdős–Pósa property of obstructions to interval graphs (Q6094044) (← links)
- On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs (Q6146268) (← links)
- A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups (Q6199337) (← links)
- Sparse graphs with bounded induced cycle packing number have logarithmic treewidth (Q6500104) (← links)
