ISSN:
1588-2829
Keywords:
Primary 05C70
;
Graphs
;
factorization
;
matching
;
traceable
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract A graph israndomly matchable if every matching of the graph is contained in a perfect matching. We generalize this notion and say that a graphG israndomly H-coverable if every set of independent subgraphs, each isomorphic toH, that does not cover the vertices ofG can be extended to a larger set of independent copies ofH. Various problems are considered for the situation whereH is a path. In particular, we characterize the graphs that are randomlyP 3 -coverable.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01855800
Permalink