Disjoint Even Cycles Packing

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

zbMATH Keywords

theta grapheven cyclevertex-disjoint

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• K₄⁻‐factor in a graph
• Vertex-disjoint copies of K₄^-
• Approximation algorithms and hardness results for cycle packing problems
• On the maximal number of independent circuits in a graph

This page was built for publication: Disjoint Even Cycles Packing