Two kinds of equipackable paths and cycles.

zbMATH Open1265.05511MaRDI QIDQ4897496FDOQ4897496

Authors: Liandi Zhang, Yuqin Zhang 

Publication date: 19 December 2012

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

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)

Cited In (10)

• \({P_5}\)-equipackable special graphs
• \(P_m\cup P_k\)-equipackable paths and cycles.
• Title not available (Why is that?)
• Title not available (Why is that?)
• All \(P_{3}\)-equipackable graphs
• \(M_{2}\)-equipackable graphs
• Two kinds of equicoverable paths and cycles.
• \(H\)-equipackable paths and cycles for \(H=P_4\) and \(H=M_3\)
• Characterization of \(P_3\cup P_2\)-equipackable graphs with \(3m\) \((m\geq 1)\) edges
• 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)