All \(P_{3}\)-equipackable graphs

DOI10.1016/j.disc.2008.09.018zbMath1189.05144OpenAlexW2158740926MaRDI QIDQ960935

Preben Dahl Vestergaard, Bert Randerath

Publication date: 29 March 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.09.018

zbMATH Keywords

PackingDecompositionEquitable

Mathematics Subject Classification ID

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

Related Items (4)

All \(M_{2}\)-equicoverable graphs ⋮ P4-equicoverable graphs which contain cycles with length at least 4 ⋮ \(P_{3}\)-equicoverable graphs-research on \(H\)-equicoverable graphs ⋮ Randomly \(P_k\)-decomposable graphs

Cites Work

• Randomly decomposable graphs
• Random packings of graphs
• A short update on equipackable graphs
• \(M_{2}\)-equipackable graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: All \(P_{3}\)-equipackable graphs