Disjoint cycles of order at least 5

zbMATH Open1404.05099MaRDI QIDQ4616092FDOQ4616092

Authors: Hong Wang 

Publication date: 30 January 2019

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/71/ajc_v71_p054.pdf

Recommendations

• Disjoint 5-cycles in a graph
• Disjoint long cycles in a graph
• scientific article; zbMATH DE number 6010662
• Disjoint cycles with prescribed lengths and independent edges in graphs
• Vertex-disjoint cycles of the same length.

zbMATH Keywords

maximum number of disjoint cycles

Mathematics Subject Classification ID

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

Cites Work

• On the maximal number of independent circuits in a graph
• Title not available (Why is that?)
• Proof of the Erdős-Faudree conjecture on quadrilaterals
• On circuits in graphs
• On quadrilaterals in a graph
• Vertex-disjoint quadrilaterals in graphs
• An extension of the Corrádi-Hajnal theorem
• Disjoint 5-cycles in a graph

Cited In (7)

• Five discordant permutations
• Existence of two disjoint long cycles in graphs
• Disjoint 5-cycles in a graph
• Title not available (Why is that?)
• Five Cycles are Highly Ramsey Infinite
• Disjoint long cycles in a graph
• Pentagons and cycle coverings

This page was built for publication: Disjoint cycles of order at least 5

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