On Independent Circuits Contained in a Graph
From MaRDI portal
Publication:5338790
DOI10.4153/CJM-1965-035-8zbMath0129.39904OpenAlexW2332112754WikidataQ105890458 ScholiaQ105890458MaRDI QIDQ5338790
Publication date: 1965
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1965-035-8
Related Items (only showing first 100 items - show all)
The edge-Erdős-Pósa property ⋮ Graph minors. V. Excluding a planar graph ⋮ Edge-disjoint odd cycles in 4-edge-connected graphs ⋮ An edge variant of the Erdős-Pósa property ⋮ Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs ⋮ Spectral radius, edge-disjoint cycles and cycles of the same length ⋮ Kernelization of Cycle Packing with Relaxed Disjointness Constraints ⋮ Nearly sign-nonsingular matrices ⋮ Packing and Covering Immersion Models of Planar Subcubic Graphs ⋮ All Circuits Enumeration in Macro-Econometric Models ⋮ Eigenschaften von Graphen, die keine k+1 knotenfremde Kreise enthalten ⋮ On the feedback number of 3-uniform linear extremal hypergraphs ⋮ A Tighter Erdős-Pósa Function for Long Cycles ⋮ A tight Erdős-Pósa function for long cycles ⋮ Frames, $A$-Paths, and the Erdös--Pósa Property ⋮ Approximate min-max relations on plane graphs ⋮ On line graphs of subcubic triangle-free graphs ⋮ Packing and covering immersion-expansions of planar sub-cubic graphs ⋮ Disjoint cycles in digraphs ⋮ Packing directed circuits ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Approximate min-max relations for odd cycles in planar graphs ⋮ Towards a polynomial kernel for directed feedback vertex set ⋮ Packing arc-disjoint cycles in tournaments ⋮ Some recent progress and applications in graph minor theory ⋮ Almost always observable hybrid systems ⋮ Kernels for deletion to classes of acyclic digraphs ⋮ Erdös-Pósa Property of Obstructions to Interval Graphs ⋮ Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs ⋮ Approximation and Kernelization for Chordal Vertex Deletion ⋮ Complete acyclic colorings ⋮ Packing cycles in undirected group-labelled graphs ⋮ Kernelization of arc disjoint cycle packing in \(\alpha\)-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 ⋮ \(K_4\)-expansions have the edge-Erdős-Pósa property ⋮ Erdős–Pósa property of obstructions to interval graphs ⋮ Packing cycles in graphs ⋮ Graphs with not too many spanning trees ⋮ Packing cycles exactly in polynomial time ⋮ Erdős-Pósa property of chordless cycles and its applications ⋮ Packing \(A\)-paths of length zero modulo a prime ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Packing cycles through prescribed vertices under modularity constraints ⋮ A Tight Erdös--Pósa Function for Wheel Minors ⋮ Lower bounds on kernelization ⋮ Erdös--Pósa from Ball Packing ⋮ Edge-disjoint odd cycles in planar graphs. ⋮ Recent Progress on Well-Quasi-ordering Graphs ⋮ Cycle multiplicity of some total graphs ⋮ Chordless Cycle Packing Is Fixed-Parameter Tractable ⋮ On the presence of disjoint subgraphs of a specified type ⋮ Excluded Forest Minors and the Erdős–Pósa Property ⋮ Explicit linear kernels for packing problems ⋮ Jones' conjecture in subcubic graphs ⋮ Packing \(A\)-paths of length zero modulo four ⋮ Packing and covering immersions in 4-edge-connected graphs ⋮ Random graphs containing few disjoint excluded minors ⋮ An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) ⋮ On obstructions to small face covers in planar graphs ⋮ Half-integral packing of odd cycles through prescribed vertices ⋮ Hitting subgraphs in \(P_4\)-tidy graphs ⋮ Packing disjoint cycles over vertex cuts ⋮ Unnamed Item ⋮ Disjoint cycles intersecting a set of vertices ⋮ S-functions for graphs ⋮ Small cocircuits in matroids ⋮ Packing cycles through prescribed vertices ⋮ Hitting Forbidden Minors: Approximation and Kernelization ⋮ On independent circuits of a digraph ⋮ Random unlabelled graphs containing few disjoint cycles ⋮ Über ein graphentheoretisches Ergebnis von T. Gallai ⋮ VC-dimension and Erdős-Pósa property ⋮ The Erdös-Pósa property for matroid circuits ⋮ A polynomial kernel for distance-hereditary vertex deletion ⋮ On the odd-minor variant of Hadwiger's conjecture ⋮ Packing and covering balls in graphs excluding a minor ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Strengthening Erdös-Pósa property for minor-closed graph classes ⋮ The parameterized complexity of cycle packing: indifference is not an issue ⋮ Cycles in digraphs– a survey ⋮ Packing Arc-Disjoint Cycles in Tournaments ⋮ Wohlquasigeordnete Klassen endlicher Graphen ⋮ Packing Cycles Faster Than Erdos--Posa ⋮ Random Graphs with Few Disjoint Cycles ⋮ Parameterised algorithms for deletion to classes of DAGs ⋮ Personal reminiscences and remarks on the mathematical work of Tibor Gallai ⋮ Distance spectrum, 1-factor and vertex-disjoint cycles ⋮ Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs ⋮ Characterizations of matroids with an element lying in a restricted number of circuits ⋮ Planar Digraphs ⋮ In absence of long chordless cycles, large tree-width becomes a local phenomenon ⋮ $K_4$-Subdivisions Have the Edge-Erdös--Pósa Property ⋮ Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles ⋮ A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits ⋮ Packing arc-disjoint cycles in oriented graphs
This page was built for publication: On Independent Circuits Contained in a Graph
