ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Periodica mathematica Hungarica 16 (1985), S. 15-22 
    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
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Periodica mathematica Hungarica 16 (1985), S. 287-293 
    ISSN: 1588-2829
    Keywords: Primary 05C35 ; Connected graphs ; domination number ; product of graphs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper we present a characterization of connected graphs of order 2n with domination numbern. Using this class of graphs, we determine an infinite class of graphs with the property that the domination number of the product of any two is precisely the product of the domination numbers.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...