Independence number and vertex-disjoint cycles

DOI10.1016/J.DISC.2005.11.086zbMATH Open1117.05080OpenAlexW2052169294MaRDI QIDQ878646FDOQ878646

Authors: Yoshimi Egawa, Hikoe Enomoto, Katsuhiro Ota, Ingo Schiermeyer, Stanislav 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

Recommendations

• Disjoint cycles in graphs with restricted independence number
• Independence number and disjoint theta graphs
• The independence number of graphs with a forbidden cycle and Ramsey numbers
• scientific article; zbMATH DE number 3885948
• On the maximum number of independent cycles in a graph

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Graph Theory and Probability
• On the maximal number of independent circuits in a graph
• 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

Cited In (6)

• The independence numbers of weighted graphs with forbidden cycles
• Packing disjoint cycles over vertex cuts
• Independence number of iterated line digraphs
• \(k\) disjoint cycles containing specified independent vertices
• The optimal proper connection number of a graph with given independence number
• The independence number of graphs with a forbidden cycle and Ramsey numbers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878646)