Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Ostermeier, Lydia"'
Autor:
Ostermeier, Lydia
In this thesis, we investigate graphs and hypergraphs that have (relaxed) product structures. In the class of graphs, we discuss in detail \\emph{RSP-relations}, a relaxation of relations fulfilling the square property and therefore of the product re
Externí odkaz:
https://ul.qucosa.de/id/qucosa%3A13304
https://ul.qucosa.de/api/qucosa%3A13304/attachment/ATT-0/
https://ul.qucosa.de/api/qucosa%3A13304/attachment/ATT-0/
A surprising diversity of different products of hypergraphs have been discussed in the literature. Most of the hypergraph products can be viewed as generalizations of one of the four standard graph products. The most widely studied variant, the so-ca
Externí odkaz:
http://arxiv.org/abs/1705.06037
Several variants of hypergraph products have been introduced as generalizations of the strong and direct products of graphs. Here we show that only some of them are associative. In addition to the Cartesian product, these are the minimal rank preserv
Externí odkaz:
http://arxiv.org/abs/1511.07162
Graph products are characterized by the existence of non-trivial equivalence relations on the edge set of a graph that satisfy a so-called square property. We investigate here a generalization, termed RSP-relations. The class of graphs with non-trivi
Externí odkaz:
http://arxiv.org/abs/1407.3164
It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time. Essential for the PFD computation is the construction of the so-called
Externí odkaz:
http://arxiv.org/abs/1305.1824
Equivalence relations on the edge set of a graph $G$ that satisfy restrictive conditions on chordless squares play a crucial role in the theory of Cartesian graph products and graph bundles. We show here that such relations in a natural way induce eq
Externí odkaz:
http://arxiv.org/abs/1301.6898
Publikováno v:
In Discrete Applied Mathematics 10 July 2014 171:60-71
Publikováno v:
In Discrete Mathematics 6 January 2012 312(1):74-80
Publikováno v:
In Nurse Leader 2006 4(4):38-41
Autor:
Ostermeier, Lydia glydia@bioinf.uni-leipzig.de, Stadler, Peter studla@bioinf.uni-leipzig.de
Publikováno v:
Graphs & Combinatorics. May2015, Vol. 31 Issue 3, p757-770. 14p.