Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Gustav Burosch"'
Publikováno v:
Rendiconti di Matematica e delle Sue Applicazioni, Vol 17, Iss 3, Pp 373-385 (1997)
We prove that a hypergraph is a product of a finite number of edges if and only if it is interval-regular, satisfies the gated-edge property and has a vertex of finite degree. As a consequence, we get a characterization of Hamming graphs.
Externí odkaz:
https://doaj.org/article/81caa3e2d3f24e438c8d1e8102f29590
Publikováno v:
Journal of Graph Theory. 22:347-356
Publikováno v:
Discrete Mathematics. 152:55-68
We define the t -uniform cube-hypergraph of dimension n , Q ( n , t ), as the hypergraph which is the natural analogue of the n -dimensional hypercube Q n , and give a characterization of those t -uniform hypergraphs which are isomorphic to Q ( n , t
Publikováno v:
Discrete Mathematics. 137(1-3):77-85
We define the t-uniform cube-hypergraphs of dimension n, Q(n,t), and give two characterizations of those t-uniform hypergraphs isometrically embeddalbe into Q(t, n). This extends previous results of Djokovic (1973) and of Graham and Winkler (1984, 19
Publikováno v:
Discrete Mathematics. 110:9-16
The aim of this paper is to study the class of s.c. distance monotone graphs which arise naturally when investigating some intersection properties of graphs. A new characterization of hypercubes is also obtained.
Autor:
Gustav Burosch, Jean-Marie Laborde
Publikováno v:
Discrete Mathematics. 87(1):85-88
In this paper we are mainly interested in the characterization of grid graphs i.e. products of paths.
Four kinds of dimensions μ i ( G ) of a finite graph G are defined and studied, i = 1, 2, 3, 4. Dimension μ 1 ( G ) is the “Sabidussi dimension” and μ 2 ( G ) coincides with the “isometric dimension” of G defined by R. L. Graham and P. M.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d508e41a34dc55ae1fbd48ea057df069
https://doi.org/10.1016/s0167-5060(08)70605-8
https://doi.org/10.1016/s0167-5060(08)70605-8
Autor:
Gustav Burosch, Jean-Marie Laborde
Publikováno v:
European Journal of Combinatorics. 9:207-214
This paper deals with intersection properties for structures extending earlier results by M. Simonovits and V. T. Sós. One of the results asserts that for a given graph G = (V, E) with girth r (satisfying some additional technical assumption), if G1
Autor:
Gustav Burosch
Publikováno v:
Mathematische Nachrichten. 49:369-373
Publikováno v:
Discrete Mathematics. (1-3):69-91
The posetBm, n, which consists of the naturally ordered subwords of the cyclic word on length n on an alphabet of m letters, where subwords are obtained by deleting letters, is introduced and studied. This poset is of special interest since it is str