A note on disjoint cycles

DOI10.1016/j.ipl.2011.11.006zbMath1253.68156OpenAlexW2088478548MaRDI QIDQ413261

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

zbMATH Keywords

combinatorial problemsvertex-disjoint cyclesmaximum genus

Mathematics Subject Classification ID

Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Approximability of packing disjoint cycles
• Characterization of the maximum genus of a signed graph
• How to determine the maximum genus of a graph
• On the existence of disjoint cycles in a graph
• On the maximum genus of a graph
• A Kuratowski-type theorem for the maximum genus of a graph
• A Characterization in of Upper-Embeddable Graphs
• Packing cycles in undirected graphs
• Approximation algorithms and hardness results for cycle packing problems
• On the maximal number of independent circuits in a graph
• Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on disjoint cycles