• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 22 matches

• 2008
• 
  Katja Prnaver, Blaz Zmazek:
  On total chromatic number of direct product graphs. CTW 2008: 127-130
• 
  Katja Prnaver, Igor Pesek, Blaz Zmazek:
  Computer aided support systems in the E-um project. ITI 2008: 625-630
• 2007
• 
  Blaz Zmazek, Janez Zerovnik:
  Weak reconstruction of strong product graphs. Discret. Math. 307(3-5): 641-649 (2007)
• 2005
• 
  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)
• 
  Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Blaz Zmazek:
  Hypercubes As Direct Products. SIAM J. Discret. Math. 18(4): 778-786 (2005)
• 
  Blaz Zmazek, Janez Zerovnik:
  Estimating the Traffic on Weighted Cactus Networks in Linear Time. IV 2005: 536-541
• 2004
• 
  Blaz Zmazek, Janez Zerovnik:
  The obnoxious center problem on weighted cactus graphs. Discret. Appl. Math. 136(2-3): 377-386 (2004)
• 
  Blaz Zmazek, Janez Zerovnik:
  Behzad-Vizing conjecture and Cartesian product graphs. Electron. Notes Discret. Math. 17: 297-300 (2004)
• 
  Blaz Zmazek, Janez Zerovnik:
  Behzad-Vizing Conjecture and Cartesian Product Graphs. CTW 2004: 257-260
• 2003
• 
  Bostjan Bresar, Blaz Zmazek:
  On the independence graph of a graph. Discret. Math. 272(2-3): 263-268 (2003)
• 
  Wilfried Imrich, Blaz Zmazek, Janez Zerovnik:
  Weak k-reconstruction of Cartesian products. Discuss. Math. Graph Theory 23(2): 273-285 (2003)
• 
  Blaz Zmazek, Janez Zerovnik:
  On the Weak Reconstruction of Strong Product Graphs. Electron. Notes Discret. Math. 13: 123-127 (2003)
• 2002
• 
  Blaz Zmazek, Janez Zerovnik:
  Behzad-Vizing conjecture and Cartesian-product graphs. Appl. Math. Lett. 15(6): 781-784 (2002)
• 
  Blaz Zmazek, Janez Zerovnik:
  Algorithm for recognizing Cartesian graph bundles. Discret. Appl. Math. 120(1-3): 275-302 (2002)
• 
  Blaz Zmazek, Janez Zerovnik:
  Unique square property and fundamental factorizations of graph bundles. Discret. Math. 244(1-3): 551-561 (2002)
• 2001
• 
  Blaz Zmazek, Janez Zerovnik:
  On recognizing Cartesian graph bundles. Discret. Math. 233(1-3): 381-391 (2001)
• 
  Blaz Zmazek, Janez Zerovnik:
  The obnoxious center problem on weighted cactus graphs (Extended Abstract). Electron. Notes Discret. Math. 8: 133-136 (2001)
• 
  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
• 
  Blaz Zmazek, Janez Zerovnik:
  Recognizing weighted directed cartesian graph bundles. Discuss. Math. Graph Theory 20(1): 39-56 (2000)
• 1999
• 
  Blaz Zmazek, Janez Zerovnik:
  Algorithm for Recognizing Cartesian Graph Bundles. Electron. Notes Discret. Math. 3: 217-221 (1999)
• 1997
• 
  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
• 
  Sandi Klavzar, Blaz Zmazek:
  On a Vizing-like conjecture for direct product graphs. Discret. Math. 156(1-3): 243-246 (1996)