Pages that link to "Item:Q3812269"

The following pages link to On the presence of disjoint subgraphs of a specified type (Q3812269):

Displaying 46 items.

• Packing cycles through prescribed vertices under modularity constraints (Q444427) (← links)
• Packing cycles with modularity constraints (Q653988) (← links)
• Graphs without two vertex-disjoint \(S\)-cycles (Q785795) (← links)
• The edge-Erdős-Pósa property (Q822640) (← links)
• The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces (Q868342) (← links)
• Some recent progress and applications in graph minor theory (Q878052) (← links)
• Edge-disjoint odd cycles in graphs with small chromatic numbers (Q1296141) (← links)
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
• A gentle introduction to applications of algorithmic metatheorems for space and circuit classes (Q1736808) (← links)
• The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs (Q1748270) (← links)
• Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation (Q2099416) (← links)
• Erdős-Pósa property of chordless cycles and its applications (Q2200918) (← links)
• Towards tight(er) bounds for the excluded grid theorem (Q2221926) (← links)
• Packing \(A\)-paths of length zero modulo four (Q2237857) (← links)
• Half-integral packing of odd cycles through prescribed vertices (Q2259381) (← links)
• Packing cycles through prescribed vertices (Q2275896) (← links)
• In absence of long chordless cycles, large tree-width becomes a local phenomenon (Q2338644) (← links)
• Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
• A tight Erdős-Pósa function for long cycles (Q2396891) (← links)
• Packing and covering immersion-expansions of planar sub-cubic graphs (Q2400977) (← links)
• Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
• Quick but odd growth of cacti (Q2408205) (← links)
• Minimum degree conditions for vertex-disjoint even cycles in large graphs (Q2439893) (← links)
• Non-zero disjoint cycles in highly connected group labelled graphs (Q2490257) (← links)
• Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
• Disjoint Even Cycles Packing (Q2851449) (← links)
• Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles (Q2862553) (← links)
• The Erdős-Pósa Property for Long Circuits (Q2930041) (← links)
• Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
• Strengthening Erdös-Pósa property for minor-closed graph classes (Q3083410) (← links)
• Non-zero disjoint cycles in highly connected group labeled graphs (Q3439347) (← links)
• The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (Q3586006) (← links)
• Frames, $A$-Paths, and the Erdös--Pósa Property (Q4564886) (← links)
• Packing and Covering Induced Subdivisions (Q4986803) (← links)
• Erdös--Pósa Property for Labeled Minors: 2-Connected Minors (Q4990390) (← links)
• Erdös--Pósa from Ball Packing (Q5130570) (← links)
• The Impact of Locality in the Broadcast Congested Clique Model (Q5220411) (← links)
• Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks (Q5348493) (← links)
• A Tight Erdös--Pósa Function for Wheel Minors (Q5374439) (← links)
• Random graphs containing few disjoint excluded minors (Q5409864) (← links)
• (Q5743487) (← links)
• (Q5743513) (← links)
• $K_4$-Subdivisions Have the Edge-Erdös--Pósa Property (Q5857001) (← links)
• Packing cycles in undirected group-labelled graphs (Q6038589) (← links)
• Even A‐cycles have the edge‐Erdős–Pósa property (Q6081562) (← links)
• A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups (Q6199337) (← links)