Two kinds of equipackable paths and cycles.

MaRDI QIDQ4897496zbMATH OpenFDO

Authors Liandi Zhang, Yuqin Zhang

Publication date 19 December 2012

zbMATH Keywords

equipackablematchingpath

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 P_k-equipackable paths and cycles.
• scientific article; zbMATH DE number 1185608
• H-equipackable paths and cycles for H=P₄ and H=M₃
• Two kinds of equicoverable paths and cycles.
• Equipackable graphs

Cited in

(10)

• \(M_{2}\)-equipackable graphs
• Two kinds of equicoverable paths and cycles.
• H-equipackable paths and cycles for H=P₄ and H=M₃
• scientific article; zbMATH DE number 1185608 (Why is no real title available?)
• \({P_5}\)-equipackable special graphs
• scientific article; zbMATH DE number 1409232 (Why is no real title available?)
• P_m P_k-equipackable paths and cycles.
• Equipackable graphs
• Characterization of P₃ P₂-equipackable graphs with 3m (m 1) edges
• All \(P_{3}\)-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)