A characterization of the graphs with high degree sum that are not covered by three cycles.

zbMATH Open1413.05189MaRDI QIDQ2829073FDOQ2829073

Authors: Shuya Chiba, Masao Tsugaki 

Publication date: 26 October 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• Degree sums and graphs that are not covered by two cycles
• Cycles through specified vertices in triangle-free graphs
• Degree Sums and Covering Cycles
• Publication:3211348
• A degree sum condition for graphs to be covered by two cycles

zbMATH Keywords

degree sumcycle cover

Mathematics Subject Classification ID

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

This page was built for publication: A characterization of the graphs with high degree sum that are not covered by three cycles.

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