P4-equicoverable graphs which contain cycles with length at least 4

DOI10.1142/S1793830917500525zbMath1373.05152MaRDI QIDQ5370827

Tianping Shuai, Jianhua Yuan, Qirui Wang, Wen-Bao Ai

Publication date: 20 October 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

coveringcycleequicoverable graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• All \(P_{3}\)-equipackable graphs
• Randomly decomposable graphs
• A short update on equipackable graphs
• \(P_{3}\)-equicoverable graphs-research on \(H\)-equicoverable graphs

This page was built for publication: P4-equicoverable graphs which contain cycles with length at least 4