On Independent Circuits Contained in a Graph
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- The Erdös-Pósa property for matroid circuits
- The minimal number of circuits in a finite set in \(R^{2k-1}\)
- Graph minors. V. Excluding a planar graph
- On consistent families of circuits
- On obstructions to small face covers in planar graphs
- S-functions for graphs
- Packing directed circuits
- Packing cycles in graphs
- Edge-disjoint odd cycles in planar graphs.
- Kernels for deletion to classes of acyclic digraphs
- \(K_4\)-expansions have the edge-Erdős-Pósa property
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Cycle multiplicity of some total graphs
- Explicit linear kernels for packing problems
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
- Personal reminiscences and remarks on the mathematical work of Tibor Gallai
- Nearly sign-nonsingular matrices
- Packing and covering immersions in 4-edge-connected graphs
- Hitting subgraphs in \(P_4\)-tidy graphs
- Packing and covering balls in graphs excluding a minor
- Distance spectrum, 1-factor and vertex-disjoint cycles
- Spectral radius, edge-disjoint cycles and cycles of the same length
- On the feedback number of 3-uniform linear extremal hypergraphs
- Almost always observable hybrid systems
- Complete acyclic colorings
- Erdős-Pósa property of chordless cycles and its applications
- Jones' conjecture in subcubic graphs
- Packing \(A\)-paths of length zero modulo four
- Half-integral packing of odd cycles through prescribed vertices
- Small cocircuits in matroids
- Packing cycles through prescribed vertices
- Parameterised algorithms for deletion to classes of DAGs
- Characterizations of matroids with an element lying in a restricted number of circuits
- In absence of long chordless cycles, large tree-width becomes a local phenomenon
- A tight Erdős-Pósa function for long cycles
- On line graphs of subcubic triangle-free graphs
- Packing and covering immersion-expansions of planar sub-cubic graphs
- Recent techniques and results on the Erdős-Pósa property
- VC-dimension and Erdős-Pósa property
- On the odd-minor variant of Hadwiger's conjecture
- Wohlquasigeordnete Klassen endlicher Graphen
- Towards a polynomial kernel for directed feedback vertex set
- Packing arc-disjoint cycles in tournaments
- Packing A-paths of length zero modulo a prime
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- Edge-disjoint odd cycles in 4-edge-connected graphs
- Hitting forbidden minors: approximation and kernelization
- An edge variant of the Erdős-Pósa property
- Quadratic upper bounds on the Erdős--Pósa property for a generalization of packing and covering cycles
- A tighter Erdős-Pósa function for long cycles
- Random unlabelled graphs containing few disjoint cycles
- Strengthening Erdős -- Pósa property for minor-closed graph classes
- Random graphs with few disjoint cycles
- Planar Digraphs
- Kernelization of cycle packing with relaxed disjointness constraints
- Packing and covering immersion models of planar subcubic graphs
- Recent progress on well-quasi-ordering graphs
- Erdös-Pósa Property of Obstructions to Interval Graphs
- Approximate min-max relations on plane graphs
- On the presence of disjoint subgraphs of a specified type
- Cycles in digraphs– a survey
- On independent circuits of a digraph
- Über ein graphentheoretisches Ergebnis von T. Gallai
- Packing cycles exactly in polynomial time
- Packing cycles through prescribed vertices under modularity constraints
- Frames, \(A\)-paths, and the Erdős-Pósa property
- Lower bounds on kernelization
- Constant congestion routing of symmetric demands in planar directed graphs
- Approximation and kernelization for chordal vertex deletion
- Graphs with not too many spanning trees
- Tomescu's Graph Coloring Conjecture for \ell-Connected Graphs
- Kernelization of Arc Disjoint Cycle Packing in \alpha -Bounded Digraphs
- Packing directed circuits quarter-integrally
- Packing Arc-Disjoint Cycles in Tournaments
- Towards a polynomial kernel for directed feedback vertex set
- Register games
- Erdős-Pósa from ball packing
- Packing cycles faster than Erdős-Pósa
- All Circuits Enumeration in Macro-Econometric Models
- scientific article; zbMATH DE number 3215864 (Why is no real title available?)
- A tight Erdős-Pósa function for wheel minors
- Excluded Forest Minors and the Erdős–Pósa Property
- Random graphs containing few disjoint excluded minors
- A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
- Eigenschaften von Graphen, die keine k+1 knotenfremde Kreise enthalten
- \(K_4\)-subdivisions have the edge-Erdős-Pósa property
- Chordless Cycle Packing Is Fixed-Parameter Tractable
- A polynomial kernel for distance-hereditary vertex deletion
- The parameterized complexity of cycle packing: indifference is not an issue
- Disjoint cycles in digraphs
- Packing cycles in undirected group-labelled graphs
- Kernelization of arc disjoint cycle packing in -bounded digraphs
- Tuza's Conjecture for Threshold Graphs
- On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments
- Towards a conjecture of Birmelé–Bondy–Reed on the Erdős–Pósa property of long cycles
- Even A‐cycles have the edge‐Erdős–Pósa property
- Erdős–Pósa property of obstructions to interval graphs
- Packing arc-disjoint cycles in oriented graphs
- Packing topological minors half‐integrally
- Induced paths in graphs without anticomplete cycles
This page was built for publication: On Independent Circuits Contained in a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5338790)
