H-equicoverable paths and cycles for P₄ and M₃

MaRDI QIDQ4901427zbMATHFDO

Authors Liandi Zhang

Publication date 24 January 2013

zbMATH Keywords

matchingcoveringequicoverable graphsequicoverable cyclesequicoverable path

Mathematics Subject Classification ID

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

Recommendations

• \(P_m\cup P_k\)-equicoverable paths and cycles.
• \(P_m\cup P_k\)-equicoverable paths and cycles.
• \(P_4\)-equicoverable graphs which contain cycles with length at least 4
• All \(M_{2}\)-equicoverable graphs
• Connected \(M_{2}\)-equicoverable graphs with circumference at most 5.

Cited in

(7)

• \(P_4\)-equicoverable graphs which contain cycles with length at least 4
• \(P_m\cup P_k\)-equicoverable paths and cycles.
• Connected \(M_{2}\)-equicoverable graphs with circumference at most 5.
• \(P_m\cup P_k\)-equicoverable paths and cycles.
• \(H\)-equipackable paths and cycles for \(H=P_4\) and \(H=M_3\)
• \(P_{3}\)-equicoverable graphs-research on \(H\)-equicoverable graphs
• All \(M_{2}\)-equicoverable graphs

This page was built for publication: \(H\)-equicoverable paths and cycles for \(P_4\) and \(M_3\)

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