A short update on equipackable graphs

DOI10.1016/j.disc.2006.11.028zbMath1130.05049OpenAlexW2087894368MaRDI QIDQ2467992

Preben Dahl Vestergaard

Publication date: 30 January 2008

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

Full work available at URL: http://vbn.aau.dk/ws/files/6815284/R-2007-06.pdf

zbMATH Keywords

decompositionpackingpathrandomly decomposablerandomly packable

Mathematics Subject Classification ID

Paths and cycles (05C38) 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 ⋮ All \(P_{3}\)-equipackable graphs ⋮ \(M_{2}\)-equipackable graphs

Cites Work

• Randomly decomposable graphs
• Matching theory
• Random packings of graphs
• Totally equimatchable graphs
• Randomly matchable graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A short update on equipackable graphs