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.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- An edge variant of the Erdős-Pósa property (Q284717) (← links)
- Approximate min-max relations on plane graphs (Q358640) (← links)
- Packing cycles exactly in polynomial time (Q421271) (← links)
- Packing cycles through prescribed vertices under modularity constraints (Q444427) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Disjoint cycles in digraphs (Q595675) (← links)
- Disjoint cycles intersecting a set of vertices (Q713977) (← links)
- The edge-Erdős-Pósa property (Q822640) (← links)
- Approximate min-max relations for odd cycles in planar graphs (Q877199) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Packing disjoint cycles over vertex cuts (Q973127) (← links)
- The Erdös-Pósa property for matroid circuits (Q1003843) (← links)
- Graph minors. V. Excluding a planar graph (Q1079583) (← links)
- On obstructions to small face covers in planar graphs (Q1204479) (← links)
- S-functions for graphs (Q1230790) (← links)
- Packing directed circuits (Q1375699) (← links)
- Packing cycles in graphs (Q1403928) (← links)
- Edge-disjoint odd cycles in planar graphs. (Q1425111) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- \(K_4\)-expansions have the edge-Erdős-Pósa property (Q1689905) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Cycle multiplicity of some total graphs (Q1732823) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
- Personal reminiscences and remarks on the mathematical work of Tibor Gallai (Q1835908) (← links)
- Nearly sign-nonsingular matrices (Q1893090) (← links)
- Packing and covering immersions in 4-edge-connected graphs (Q1984514) (← links)
- Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
- Packing and covering balls in graphs excluding a minor (Q2043760) (← links)
- Distance spectrum, 1-factor and vertex-disjoint cycles (Q2080240) (← links)
- Spectral radius, edge-disjoint cycles and cycles of the same length (Q2138553) (← links)
- On the feedback number of 3-uniform linear extremal hypergraphs (Q2150590) (← links)
- Almost always observable hybrid systems (Q2178194) (← links)
- Complete acyclic colorings (Q2185231) (← links)
- Erdős-Pósa property of chordless cycles and its applications (Q2200918) (← links)
- Jones' conjecture in subcubic graphs (Q2236806) (← links)
- Packing \(A\)-paths of length zero modulo four (Q2237857) (← links)
- Half-integral packing of odd cycles through prescribed vertices (Q2259381) (← links)
- Small cocircuits in matroids (Q2275470) (← links)
- Packing cycles through prescribed vertices (Q2275896) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- Characterizations of matroids with an element lying in a restricted number of circuits (Q2331594) (← links)
- In absence of long chordless cycles, large tree-width becomes a local phenomenon (Q2338644) (← links)
- A tight Erdős-Pósa function for long cycles (Q2396891) (← links)
- On line graphs of subcubic triangle-free graphs (Q2400553) (← 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)
- VC-dimension and Erdős-Pósa property (Q2515568) (← links)
- On the odd-minor variant of Hadwiger's conjecture (Q2519011) (← links)
