Independent cycles with limited size in a graph

DOI10.1007/BF02986677zbMath0814.05052OpenAlexW1978458814MaRDI QIDQ1340129

Hong Wang

Publication date: 8 June 1995

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02986677

zbMATH Keywords

independent cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (6)

Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Disjoint long cycles in a graph ⋮ Partial Degree Conditions and Cycle Coverings ⋮ Triangles in claw-free graphs ⋮ On quadrilaterals in a graph ⋮ On the maximum number of independent cycles in a graph

Cites Work

• On the maximal number of independent circuits in a graph
• Unnamed Item
• Unnamed Item

This page was built for publication: Independent cycles with limited size in a graph