| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649176 | Discrete Mathematics | 2010 | 5 Pages |
Abstract
A graph GG is P3P3-equipackable if any sequence of successive removals of edge-disjoint copies of P3P3 from GG always terminates with a graph having at most one edge. All P3P3-equipackable graphs are characterised. They belong to a small number of families listed here.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Bert Randerath, Preben Dahl Vestergaard,