Connected M₂-equicoverable graphs with circumference at most 5.

MaRDI QIDQ2918533zbMATH OpenFDO

Authors Liandi Zhang, Yuqin Zhang

Publication date 8 October 2012

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

\(H\)-covering\(H\)-equicoverablecoverable

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• All \(M_{2}\)-equicoverable graphs
• 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₄-equicoverable graphs which contain cycles with length at least 4

Cited in

(3)

• All \(M_{2}\)-equicoverable graphs
• H-equicoverable paths and cycles for P₄ and M₃
• P₄-equicoverable graphs which contain cycles with length at least 4

This page was built for publication: Connected \(M_{2}\)-equicoverable graphs with circumference at most 5.

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