default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBlaz Zmazek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[c4]Katja Prnaver, Blaz Zmazek:
On total chromatic number of direct product graphs. CTW 2008: 127-130- [c3]Katja Prnaver, Igor Pesek, Blaz Zmazek:
Computer aided support systems in the E-um project. ITI 2008: 625-630 - 2007
- [j18]Blaz Zmazek, Janez Zerovnik
:
Weak reconstruction of strong product graphs. Discret. Math. 307(3-5): 641-649 (2007) - 2005
- [j17]Bostjan Bresar, Pranava K. Jha, Sandi Klavzar, Blaz Zmazek:
Median and quasi-median direct products of graphs. Discuss. Math. Graph Theory 25(1-2): 183-196 (2005) - [j16]Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Blaz Zmazek:
Hypercubes As Direct Products. SIAM J. Discret. Math. 18(4): 778-786 (2005) - [c2]Blaz Zmazek, Janez Zerovnik:
Estimating the Traffic on Weighted Cactus Networks in Linear Time. IV 2005: 536-541 - 2004
- [j15]Blaz Zmazek, Janez Zerovnik:
The obnoxious center problem on weighted cactus graphs. Discret. Appl. Math. 136(2-3): 377-386 (2004) - [j14]Blaz Zmazek, Janez Zerovnik:
Behzad-Vizing conjecture and Cartesian product graphs. Electron. Notes Discret. Math. 17: 297-300 (2004) - [c1]Blaz Zmazek, Janez Zerovnik:
Behzad-Vizing Conjecture and Cartesian Product Graphs. CTW 2004: 257-260 - 2003
- [j13]Bostjan Bresar, Blaz Zmazek:
On the independence graph of a graph. Discret. Math. 272(2-3): 263-268 (2003) - [j12]Wilfried Imrich, Blaz Zmazek, Janez Zerovnik:
Weak k-reconstruction of Cartesian products. Discuss. Math. Graph Theory 23(2): 273-285 (2003) - [j11]Blaz Zmazek, Janez Zerovnik:
On the Weak Reconstruction of Strong Product Graphs. Electron. Notes Discret. Math. 13: 123-127 (2003) - 2002
- [j10]Blaz Zmazek, Janez Zerovnik:
Behzad-Vizing conjecture and Cartesian-product graphs. Appl. Math. Lett. 15(6): 781-784 (2002) - [j9]Blaz Zmazek, Janez Zerovnik:
Algorithm for recognizing Cartesian graph bundles. Discret. Appl. Math. 120(1-3): 275-302 (2002) - [j8]Blaz Zmazek, Janez Zerovnik:
Unique square property and fundamental factorizations of graph bundles. Discret. Math. 244(1-3): 551-561 (2002) - 2001
- [j7]Blaz Zmazek, Janez Zerovnik:
On recognizing Cartesian graph bundles. Discret. Math. 233(1-3): 381-391 (2001) - [j6]Blaz Zmazek, Janez Zerovnik:
The obnoxious center problem on weighted cactus graphs (Extended Abstract). Electron. Notes Discret. Math. 8: 133-136 (2001) - [j5]Tomaz Pisanski, Blaz Zmazek, Janez Zerovnik:
An algorithm for K-convex closure and an application. Int. J. Comput. Math. 78(1): 1-11 (2001) - 2000
- [j4]Blaz Zmazek, Janez Zerovnik:
Recognizing weighted directed cartesian graph bundles. Discuss. Math. Graph Theory 20(1): 39-56 (2000)
1990 – 1999
- 1999
- [j3]Blaz Zmazek, Janez Zerovnik:
Algorithm for Recognizing Cartesian Graph Bundles. Electron. Notes Discret. Math. 3: 217-221 (1999) - 1997
- [j2]Pranava K. Jha, Sandi Klavzar, Blaz Zmazek:
Isomorphic components of Kronecker product of bipartite graphs. Discuss. Math. Graph Theory 17(2): 301-309 (1997) - 1996
- [j1]Sandi Klavzar, Blaz Zmazek:
On a Vizing-like conjecture for direct product graphs. Discret. Math. 156(1-3): 243-246 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
