Two kinds of equicoverable paths and cycles.

MaRDI QIDQ2804748zbMATH OpenFDO

Authors Liandi Zhang, Caifeng Zhou, Yuqin Zhang

Publication date 4 May 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

matchingpathcoverableequicoverable

Mathematics Subject Classification ID

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

Recommendations

• Two kinds of equipackable paths and cycles.
• \(P_m\cup P_k\)-equipackable paths and cycles.
• Equipackable graphs
• \(H\)-equipackable paths and cycles for \(H=P_4\) and \(H=M_3\)
• \(P_m\cup P_k\)-equicoverable paths and cycles.

Cited in

(4)

• Two kinds of equipackable paths and cycles.
• \(P_m\cup P_k\)-equipackable paths and cycles.
• \(M_{2}\)-equipackable graphs
• \(P_m\cup P_k\)-equicoverable paths and cycles.

This page was built for publication: Two kinds of equicoverable paths and cycles.

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