Pages that link to "Item:Q5338790"
From MaRDI portal
The following pages link to On Independent Circuits Contained in a Graph (Q5338790):
Displaying 50 items.
- Wohlquasigeordnete Klassen endlicher Graphen (Q2544591) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
- Packing \(A\)-paths of length zero modulo a prime (Q2692782) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles (Q2862553) (← links)
- A Tighter Erdős-Pósa Function for Long Cycles (Q2922220) (← links)
- The Erdős-Pósa Property for Long Circuits (Q2930041) (← links)
- Random unlabelled graphs containing few disjoint cycles (Q3068766) (← links)
- Strengthening Erdös-Pósa property for minor-closed graph classes (Q3083410) (← links)
- Random Graphs with Few Disjoint Cycles (Q3103626) (← links)
- Planar Digraphs (Q3120437) (← links)
- Kernelization of Cycle Packing with Relaxed Disjointness Constraints (Q3174716) (← links)
- Packing and Covering Immersion Models of Planar Subcubic Graphs (Q3181048) (← links)
- Recent Progress on Well-Quasi-ordering Graphs (Q3295151) (← links)
- Erdös-Pósa Property of Obstructions to Interval Graphs (Q3304101) (← links)
- On the presence of disjoint subgraphs of a specified type (Q3812269) (← links)
- Cycles in digraphs– a survey (Q3907591) (← links)
- On independent circuits of a digraph (Q4163550) (← links)
- Über ein graphentheoretisches Ergebnis von T. Gallai (Q4172084) (← links)
- Frames, $A$-Paths, and the Erdös--Pósa Property (Q4564886) (← links)
- Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs (Q4582017) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- Graphs with not too many spanning trees (Q4861349) (← links)
- Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs (Q4997140) (← links)
- Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs (Q5042259) (← links)
- (Q5075819) (← links)
- Packing Arc-Disjoint Cycles in Tournaments (Q5092386) (← links)
- (Q5111250) (← links)
- (Q5114824) (← links)
- Erdös--Pósa from Ball Packing (Q5130570) (← links)
- Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
- All Circuits Enumeration in Macro-Econometric Models (Q5302460) (← links)
- A Tight Erdös--Pósa Function for Wheel Minors (Q5374439) (← links)
- Excluded Forest Minors and the Erdős–Pósa Property (Q5397727) (← links)
- Random graphs containing few disjoint excluded minors (Q5409864) (← links)
- A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits (Q5538409) (← links)
- Eigenschaften von Graphen, die keine <i>k</i>+1 knotenfremde Kreise enthalten (Q5589882) (← links)
- $K_4$-Subdivisions Have the Edge-Erdös--Pósa Property (Q5857001) (← links)
- Chordless Cycle Packing Is Fixed-Parameter Tractable (Q5874543) (← links)
- A polynomial kernel for distance-hereditary vertex deletion (Q5918311) (← links)
- The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)
- Packing cycles in undirected group-labelled graphs (Q6038589) (← links)
- Kernelization of arc disjoint cycle packing in \(\alpha\)-bounded digraphs (Q6038707) (← links)
- Tuza's Conjecture for Threshold Graphs (Q6045403) (← links)
- On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments (Q6045407) (← links)
- Towards a conjecture of Birmelé–Bondy–Reed on the Erdős–Pósa property of long cycles (Q6047641) (← links)
- Even A‐cycles have the edge‐Erdős–Pósa property (Q6081562) (← links)
- Erdős–Pósa property of obstructions to interval graphs (Q6094044) (← links)
