Short disjoint cycles in graphs with degree constraints

DOI10.1016/0166-218X(94)00133-XzbMath0848.05044OpenAlexW2024376325MaRDI QIDQ1917248

Andreas Brandstädt, Heinz-Juergen Voss

Publication date: 7 July 1996

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

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00133-x

zbMATH Keywords

degree constraints

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits

This page was built for publication: Short disjoint cycles in graphs with degree constraints