ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Primary 05C70  (1)
  • Springer  (1)
  • American Institute of Physics (AIP)
  • 1985-1989  (1)
Collection
Keywords
Publisher
  • Springer  (1)
  • American Institute of Physics (AIP)
Years
  • 1985-1989  (1)
Year
  • 1
    Electronic Resource
    Electronic Resource
    RandomlyH-coverable graphs (1985)
    Springer
    Periodica mathematica Hungarica 16 (1985), S. 15-22 
    Details
    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
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...