Characterization of P₃ P₂-equipackable graphs with 3m (m 1) edges

DOI10.1007/S00373-024-02846-WMaRDI QIDQ6640964zbMATH OpenFDO

Authors Caifeng Zhou, Yuqin Zhang, Yan Guo

Publication date 20 November 2024

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

zbMATH Keywords

disconnected graph\(H\)-packing\(H\)-equipackable graph\(H\)-packable graphrandomly \(H\)-packable graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3974987 (Why is no real title available?)
• scientific article; zbMATH DE number 3710196 (Why is no real title available?)
• A short update on equipackable graphs
• All \(P_{3}\)-equipackable graphs
• Equipackable graphs
• Random packings of graphs
• Randomly decomposable graphs
• \(H\)-equipackable paths and cycles for \(H=P_4\) and \(H=M_3\)
• \(M_{2}\)-equipackable graphs

This page was built for publication: Characterization of \(P_3\cup P_2\)-equipackable graphs with \(3m\) \((m\geq 1)\) edges

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