Two kinds of equipackable paths and cycles.

MaRDI QIDQ4897496zbMATH OpenFDO

Authors Liandi Zhang, Yuqin Zhang

Publication date 19 December 2012

zbMATH Keywords

matchingpathequipackable

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• \(P_m\cup P_k\)-equipackable paths and cycles.
• scientific article; zbMATH DE number 1185608
• \(H\)-equipackable paths and cycles for \(H=P_4\) and \(H=M_3\)
• Two kinds of equicoverable paths and cycles.
• Equipackable graphs

Cited in

(10)

• Equipackable graphs
• All \(P_{3}\)-equipackable graphs
• scientific article; zbMATH DE number 1409232 (Why is no real title available?)
• Two kinds of equicoverable paths and cycles.
• \(H\)-equipackable paths and cycles for \(H=P_4\) and \(H=M_3\)
• \(P_m\cup P_k\)-equipackable paths and cycles.
• \({P_5}\)-equipackable special graphs
• Characterization of \(P_3\cup P_2\)-equipackable graphs with \(3m\) \((m\geq 1)\) edges
• scientific article; zbMATH DE number 1185608 (Why is no real title available?)
• \(M_{2}\)-equipackable graphs

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

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