Covering a graph with cycles of length at least 4

zbMath1391.05149MaRDI QIDQ1753038

Hong Wang

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p67

zbMATH Keywords

cyclesdisjoint cyclescycle coverings

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Proof of the Erdős-Faudree conjecture on quadrilaterals
• Vertex-disjoint quadrilaterals in graphs
• On circuits in graphs
• \(H\)-factors in dense graphs
• Note on Hamilton Circuits
• On maximal paths and circuits of graphs
• Covering a graph with cycles
• On the maximal number of independent circuits in a graph
• Disjoint triangles and quadrilaterals in a graph

This page was built for publication: Covering a graph with cycles of length at least 4