Disjoint Even Cycles Packing
From MaRDI portal
Publication:2851449
DOI10.1016/j.endm.2009.07.019zbMath1273.05169OpenAlexW1980411478MaRDI QIDQ2851449
Tadashi Sakuma, Shuya Chiba, Ken-ichi Kawarabayashi, Shinya Fujita
Publication date: 10 October 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.019
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Disjoint chorded cycles in graphs
- On the number of independent chorded cycles in a graph
- On the presence of disjoint subgraphs of a specified type
- K4−‐factor in a graph
- Vertex-disjoint copies of K4-
- Approximation algorithms and hardness results for cycle packing problems
- On the maximal number of independent circuits in a graph
- Unnamed Item
- Unnamed Item