Randomly H-coverable graphs

DOI10.1007/BF01855800MaRDI QIDQ792344zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 1985

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01855800

zbMATH Keywords

independent subgraphsperfect matchingrandomly matchable

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random graphs (graph-theoretic aspects) (05C80) Graph theory (05C99)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 4068925
• Randomly decomposable graphs
• scientific article; zbMATH DE number 4029631
• Random packings of graphs
• scientific article; zbMATH DE number 1300357

Cites work

• Randomly matchable graphs
• Randomly Traceable Graphs

Cited in

(2)

• Randomly decomposable graphs
• scientific article; zbMATH DE number 4029631 (Why is no real title available?)

This page was built for publication: Randomly H-coverable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792344)