scientific article; zbMATH DE number 4156480

zbMATH Open0705.05045MaRDI QIDQ3484869FDOQ3484869

Authors: Italo J. Dejter, V. Neumann-Lara 

Publication date: 1988

Title of this publication is not available (Why is that?)

Recommendations

• On the maximum number of odd cycles in graphs without smaller odd cycles
• scientific article; zbMATH DE number 3904622
• scientific article; zbMATH DE number 3931048
• Finding odd cycle transversals.
• The Erdős-Pósa property for odd cycles in highly connected graphs

zbMATH Keywords

disjoint odd cycles

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cited In (13)

• Packing cycles in undirected group-labelled graphs
• On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs
• Frames, \(A\)-paths, and the Erdős-Pósa property
• Graph theory. Abstracts from the workshop held January 2--8, 2022
• \(K_4\)-subdivisions have the edge-Erdős-Pósa property
• Highly parity linked graphs
• Packing and covering odd cycles in cubic plane graphs with small faces
• A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups
• Even A‐cycles have the edge‐Erdős–Pósa property
• Packing and covering odd cycles in cubic plane graphs with small faces
• Erdős-Pósa property for labeled minors: 2-connected minors
• Erdős–Pósa property of obstructions to interval graphs
• Recent techniques and results on the Erdős-Pósa property

This page was built for publication:

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