Randomly H-coverable graphs (Q792344): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01855800 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049238239 / rank
 
Normal rank

Latest revision as of 12:13, 30 July 2024

scientific article
Language Label Description Also known as
English
Randomly H-coverable graphs
scientific article

    Statements

    Randomly H-coverable graphs (English)
    0 references
    0 references
    1985
    0 references
    A graph is randomly matchable if every matching of the graph is contained in a perfect matching. We generalize this notion and say that a graph G is randomly H-coverable if every set of independent subgraphs, each isomorphic to H, that does not cover the vertices of G can be extended to a larger set of independent copies of H. Various problems are considered for the situation where H is a path. In particular, we characterize the graphs that are randomly \(P_ 3\)-coverable.
    0 references
    randomly matchable
    0 references
    perfect matching
    0 references
    independent subgraphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references