Equivalence relations on the edge set of a hypergraph that satisfy the “grid-property ” (a certain restrictive condition on diagonal-free grids that can be seen as a generalization of the more familiar “square property ” on graphs) play a crucial role in the theory of Cartesian hypergraph products. In particular, every convex relation with the grid property induces a factorization w.r.t. the Cartesian product. In the class of graphs, even non-convex relations with the square property provide rich structural information on local isomorphisms, local product structures, and product structures of quotient graphs. Here, we examine the grid property in its own right. Vertex partitions derived from these equivalence classes of the edges give rise ...
AbstractIn this paper, we study containment properties of graphs in relation with the Cartesian prod...
Abstract. The Cartesian product of graphs was introduced more than 50 years ago and many fundamental...
AbstractIn this note we characterize isomorphism between two hypergraphs by means of equicardinality...
Equivalence relations on the edge set of a hypergraph that satisfy the "grid property" (a certain re...
Equivalence relations on the edge set of a graph GG that satisfy restrictive conditions on chordless...
In this thesis, we investigate graphs and hypergraphs that have (relaxed) product structures. In t...
We show that every simple, (weakly) connected, possibly directed and infinite, hypergraph has a uniq...
In this work, new definitions of hypergraph products are presented. The main focus is on the general...
AbstractGraph bundles generalize the notion of covering graphs and graph products. In Imrich et al. ...
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to...
We generalize the well-known correspondence between partitions and equivalence relations on a set to...
AbstractWe show that if G is a connected graph with the same proper convex subgraphs as (Kn)r, the C...
Abstract. We study the polytopality of Cartesian products of non-polytopal graphs. On the one hand, ...
We study the polytopality of Cartesian products of non-polytopal graphs. On the one hand, we prove t...
International audienceThis paper studies edge- and total-colorings of graphs in which (all or only a...
AbstractIn this paper, we study containment properties of graphs in relation with the Cartesian prod...
Abstract. The Cartesian product of graphs was introduced more than 50 years ago and many fundamental...
AbstractIn this note we characterize isomorphism between two hypergraphs by means of equicardinality...
Equivalence relations on the edge set of a hypergraph that satisfy the "grid property" (a certain re...
Equivalence relations on the edge set of a graph GG that satisfy restrictive conditions on chordless...
In this thesis, we investigate graphs and hypergraphs that have (relaxed) product structures. In t...
We show that every simple, (weakly) connected, possibly directed and infinite, hypergraph has a uniq...
In this work, new definitions of hypergraph products are presented. The main focus is on the general...
AbstractGraph bundles generalize the notion of covering graphs and graph products. In Imrich et al. ...
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to...
We generalize the well-known correspondence between partitions and equivalence relations on a set to...
AbstractWe show that if G is a connected graph with the same proper convex subgraphs as (Kn)r, the C...
Abstract. We study the polytopality of Cartesian products of non-polytopal graphs. On the one hand, ...
We study the polytopality of Cartesian products of non-polytopal graphs. On the one hand, we prove t...
International audienceThis paper studies edge- and total-colorings of graphs in which (all or only a...
AbstractIn this paper, we study containment properties of graphs in relation with the Cartesian prod...
Abstract. The Cartesian product of graphs was introduced more than 50 years ago and many fundamental...
AbstractIn this note we characterize isomorphism between two hypergraphs by means of equicardinality...