Title of article
All -equipackable graphs
Author/Authors
Randerath، نويسنده , , Bert and Vestergaard، نويسنده , , Preben Dahl Vestergaard، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
5
From page
355
To page
359
Abstract
A graph G is P 3 -equipackable if any sequence of successive removals of edge-disjoint copies of P 3 from G always terminates with a graph having at most one edge. All P 3 -equipackable graphs are characterised. They belong to a small number of families listed here.
Keywords
Randomly packable , Packing , Covering , Factor , decomposition , Equiremovable , Equipackable
Journal title
Discrete Mathematics
Serial Year
2010
Journal title
Discrete Mathematics
Record number
1599241
Link To Document