| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650824 | Discrete Mathematics | 2007 | 6 Pages |
Abstract
Let TT be a family of graphs. A TT-packing of a graph G is a subgraph of G , components of which are isomorphic to members of TT. We are concerned with families TT, such that in every graph G , the subsets of vertices that can be saturated by some TT-packing form a collection of independent sets of a matroid. The main purpose of this paper is to introduce a new class of families with this property.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Marek Janata,