Packing cycles in graphs
From MaRDI portal
Publication:1403928
DOI10.1006/jctb.2002.2134zbMath1024.05047MaRDI QIDQ1403928
Publication date: 20 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a978dfef237d6c16af6e0c9798a4a069105d7e15
05C35: Extremal problems in graph theory
05C65: Hypergraphs
05C38: Paths and cycles
05C75: Structural characterization of families of graphs
Related Items
Packing cycles exactly in polynomial time, Packing directed circuits exactly, On the feedback vertex set polytope of a series-parallel graph, Packing disjoint cycles over vertex cuts, Packing cycles in graphs. II
Cites Work