Blaz Zmazek

Hypercubes As Direct Products

Let G be a connected bipartite graph. An involution

The obnoxious center problem on weighted cactus graphs

\alpha

Estimating the traffic on weighted cactus networks in linear time

of G that preserves the bipartition of G is called bipartite. Let

Algorithm for recognizing Cartesian graph bundles

G^\alpha

Unique square property and fundamental factorizations of graph bundles

be the graph obtained from G by adding to G the natural perfect matching induced by

Recognizing weighted directed cartesian graph bundles

\alpha

On domination numbers of graph bundles

. We show that the k-cube Qk is isomorphic to the direct product

An algorithm for K-convex closure and an application

G \times H

Weak k-reconstruction of Cartesian products

if and only if G is isomorphic to

Computer aided support systems in the E-um project

Q_{k-1}^\alpha