scientific article; zbMATH DE number 4191728

MaRDI QIDQ3211348zbMATH OpenFDO

Authors Hikoe Enomoto, Atsushi Kaneko, Zsolt Tuza

Publication date 1988

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Degree Sums and Covering Cycles
• Covering vertices by cycles
• Graph decompositions without isolates
• Covering a graph with cycles
• Cycle factors in dense graphs

Cited in

(16)

• Triangle-tilings in graphs without large independent sets
• A degree sum condition for graphs to be covered by two cycles
• Cycle partitions of regular graphs
• Cycle partitions in dense regular digraphs and oriented graphs
• Covering cycles in sparse graphs
• Cycle partition of dense regular digraphs and oriented graphs (extended abstract)
• An implicit degree condition for relative length of long paths and cycles in graphs
• On directed versions of the Corrádi-Hajnal corollary
• \(K_{1,3}\)-factors in graphs
• An extension of the Hajnal-Szemerédi theorem to directed graphs
• Transversal C_k-factors in subgraphs of the balanced blow-up of C_k
• Vertex-disjoint claws in graphs
• The existence of \(P_{\geq3}\)-factor covered graphs
• A characterization of the graphs with high degree sum that are not covered by three cycles.
• Stability for vertex cycle covers
• Perfect packings with complete graphs minus an edge

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 Q3211348)