A note on disjoint cycles
From MaRDI portal
Publication:413261
DOI10.1016/J.IPL.2011.11.006zbMATH Open1253.68156OpenAlexW2088478548MaRDI QIDQ413261FDOQ413261
Authors: Michal Kotrbčík 
Publication date: 4 May 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.11.006
Recommendations
- scientific article; zbMATH DE number 219251
- ON DISJOINT CYCLES
- A Note on Vertex-Disjoint Cycles
- On the existence of disjoint cycles in a graph
- Disjoint essential cycles
- A note on a conjecture on consistent cycles
- A note on odd/even cycles
- Disjoint cycles with chords in graphs
- A note on disjoint dijoins
- A conjecture of Verstraëte on vertex-disjoint cycles
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- On the maximal number of independent circuits in a graph
- Graphs on surfaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation algorithms and hardness results for cycle packing problems
- Title not available (Why is that?)
- How to determine the maximum genus of a graph
- A Characterization in of Upper-Embeddable Graphs
- On the existence of disjoint cycles in a graph
- Title not available (Why is that?)
- On the maximum genus of a graph
- Characterization of the maximum genus of a signed graph
- A Kuratowski-type theorem for the maximum genus of a graph
- Title not available (Why is that?)
- Packing cycles in undirected graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximability of packing disjoint cycles
- Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings
Cited In (7)
This page was built for publication: A note on disjoint cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413261)
