Independence number and vertex-disjoint cycles

DOI10.1016/J.DISC.2005.11.086zbMath1117.05080OpenAlexW2052169294MaRDI QIDQ878646

Yoshimi Egawa, Ingo Schiermeyer, Hikoe Enomoto, Katsuhiro Ota, Stanlislav Jendroľ

Publication date: 26 April 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.086

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

The optimal proper connection number of a graph with given independence number ⋮ Packing disjoint cycles over vertex cuts

Cites Work

• Unnamed Item
• On the maximum number of independent cycles in a graph
• On the existence of disjoint cycles in a graph
• Vertex-disjoint cycles of the same length
• Graph Theory and Probability
• On the maximal number of independent circuits in a graph

This page was built for publication: Independence number and vertex-disjoint cycles