Blaz Zmazek

According to our database1, Blaz Zmazek authored at least 18 papers between 1996 and 2008.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2008
Computer aided support systems in the E-um project.
Proceedings of the ITI 2008 30th International Conference on Information Technology Interfaces, 2008

On total chromatic number of direct product graphs.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2005
Hypercubes As Direct Products.
SIAM J. Discret. Math., 2005

Median and quasi-median direct products of graphs.
Discuss. Math. Graph Theory, 2005

Estimating the Traffic on Weighted Cactus Networks in Linear Time.
Proceedings of the 9th International Conference on Information Visualisation, 2005

2004
Behzad-Vizing conjecture and Cartesian product graphs.
Electron. Notes Discret. Math., 2004

The obnoxious center problem on weighted cactus graphs.
Discret. Appl. Math., 2004

2003
On the Weak Reconstruction of Strong Product Graphs.
Electron. Notes Discret. Math., 2003

Weak k-reconstruction of Cartesian products.
Discuss. Math. Graph Theory, 2003

On the independence graph of a graph.
Discret. Math., 2003

2002
Unique square property and fundamental factorizations of graph bundles.
Discret. Math., 2002

2001
An algorithm for <i>K</i>-convex closure and an application.
Int. J. Comput. Math., 2001

The obnoxious center problem on weighted cactus graphs (Extended Abstract).
Electron. Notes Discret. Math., 2001

On recognizing Cartesian graph bundles.
Discret. Math., 2001

2000
Recognizing weighted directed cartesian graph bundles.
Discuss. Math. Graph Theory, 2000

1999
Algorithm for Recognizing Cartesian Graph Bundles.
Electron. Notes Discret. Math., 1999

1997
Isomorphic components of Kronecker product of bipartite graphs.
Discuss. Math. Graph Theory, 1997

1996
On a Vizing-like conjecture for direct product graphs.
Discret. Math., 1996


  Loading...