All M₂-equicoverable graphs

DOI10.1007/S00373-016-1740-9MaRDI QIDQ2361091zbMATH OpenOpenAlexFDO

Authors Fan Wu, Liandi Zhang, Yuqin Zhang

Publication date 29 June 2017

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-016-1740-9

zbMATH Keywords

\(H\)-coverable\(H\)-covering\(H\)-equicoverablematching

Mathematics Subject Classification ID

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

Recommendations

• Connected \(M_{2}\)-equicoverable graphs with circumference at most 5.
• H-equicoverable paths and cycles for P₄ and M₃
• P_m P_k-equicoverable paths and cycles.
• \(P_m\cup P_k\)-equicoverable paths and cycles.
• \(P_{3}\)-equicoverable graphs-research on \(H\)-equicoverable graphs

Cites work

• \(M_{2}\)-equipackable graphs
• \(P_{3}\)-equicoverable graphs-research on \(H\)-equicoverable graphs
• A short update on equipackable graphs
• All \(P_{3}\)-equipackable graphs
• Connected \(M_{2}\)-equicoverable graphs with circumference at most 5.
• Equipackable graphs
• Random packings of graphs
• Randomly decomposable graphs

Cited in

(5)

• \(P_{3}\)-equicoverable graphs-research on \(H\)-equicoverable graphs
• Connected \(M_{2}\)-equicoverable graphs with circumference at most 5.
• P_m P_k-equicoverable paths and cycles.
• H-equicoverable paths and cycles for P₄ and M₃
• \(P_m\cup P_k\)-equicoverable paths and cycles.

This page was built for publication: All \(M_{2}\)-equicoverable graphs

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