scientific article; zbMATH DE number 437477

MaRDI QIDQ3140341zbMATH OpenFDO

Authors

Publication date 6 April 1994

zbMATH Keywords

coveringcyclesneighbour

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Covering vertices of a graph by \(k\) disjoint cycles
• Covering vertices by cycles
• Neighborhood unions and the cycle cover number of a graph
• scientific article; zbMATH DE number 1471073
• Covering a graph with cycles passing through given edges

Cited in

(4)

• Degree sums and graphs that are not covered by two cycles
• Neighborhood unions and the cycle cover number of a graph
• Covering vertices by cycles
• A degree sum condition for graphs to be covered by two cycles

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