Title of article
A short update on equipackable graphs Original Research Article
Author/Authors
P.D. Vestergaard، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
5
From page
161
To page
165
Abstract
A graph is called equipackable if every maximal packing in it is also maximum. This generalizes randomly packable graphs. We survey known results both on randomly packable graphs and on equipackable graphs. As a new result is given a characterization of image-equipackable graphs with all valencies at least two.
Keywords
Path , Packing , Decomposition , Randomly packable , Randomly decomposable
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947837
Link To Document