Preprinti IMFM

Avtor: Janez Žerovnik e-mail

1202: Maja Čevnik, Janez Žerovnik: Broadcasting on cactus graphs, 53 (2015) PDF
1181: Polona Pavlič, Janez Žerovnik: Formulas for various domination numbers of products of paths and cycles, 50 (2012) PDF
1177: Janez Žerovnik: Remarks on Equating of Grades at Basic and Higher Level of Mathematics Achievement, 50 (2012) PDF
1167: Polona Pavlič, Janez Žerovnik: A note on the domination number of the Cartesian products of paths and cycles, 49 (2011) PDF
1165: Polona Pavlič, Janez Žerovnik: Roman domination number of the Cartesian products of paths and cycles, 49 (2011) PDF
1140: Irena Hrastnik Ladinek, Janez Žerovnik: On connectivity and hamiltonicity of direct graph bundles, 49 (2011) PDF
1139: Irena Hrastnik Ladinek, Janez Žerovnik: Cyclic bundle hamiltonicity, 49 (2011) PDF
1058: Iztok Banič, Rija Erveš, Janez Žerovnik: Edge, vertex and mixed fault-diameters, 46 (2008) e-sigma PDF PDF
1017: Ignasi Sau, Janez Žerovnik: An optimal permutation routing algorithm for full-duplex hexagonal mesh networks, 44 (2006) e-sigma PDF PDF
1016: Iztok Banič, Janez Žerovnik: Fault-diameter of Cartesian product of graphs and Cartesian graph bundles, 44 (2006) e-sigma PDF PDF
998: Blaž Zmazek, Janez Žerovnik: On domination numbers of graph bundles, 43 (2005) e-sigma PDF PDF
988: Petra Šparl, Janez Žerovnik: 2-local 7/6-competitive algorithm for multicoloring a sub-class of hexagonal graphs, 43 (2005) e-sigma PDF PDF
987: Melita Gorše Pihler, Janez Žerovnik: Partial cubes are distance graphs, 43 (2005) e-sigma PDF PDF
954: Janez Žerovnik: A distributed 6/5-competitive algorithm for multicoloring triangle-free hexagonal graphs, 42 (2004) e-sigma PDF PDF
952: John Shawe-Taylor, Janez Žerovnik: Ants and graph coloring, 42 (2004) e-sigma PDF PDF
941: Janez Žerovnik: Deriving formulas for the pentomino exclusion problem, 42 (2004) e-sigma PDF PDF
879: Petra Šparl, Janez Žerovnik: Homomorphisms of hexagonal graphs to odd cycles, 41 (2003) e-sigma PDF PDF
836: Blaž Zmazek, Janez Žerovnik: On the weak reconstruction of strong product graphs, 40 (2002) e-sigma PDF PDF
821: Blaž Zmazek, Janez Žerovnik: Computing the weighted Wiener and Szeged number on weighted cactus graphs in linear time, 40 (2002) e-sigma PDF PDF
801: Iztok Peterin, Janez Žerovnik: Distance in the direct product of graphs, 40 (2002) e-sigma PDF PDF
776: Petra Šparl, Janez Žerovnik: 2-local 4/3-competitive algorithm for multicoloring hexagonal graphs, 39 (2001) e-sigma PDF PDF
750: Blaž Zmazek, Janez Žerovnik: The obnoxious center problem on weighted cactus graphs, 39 (2001) e-sigma PDF PDF
708: Sangho Shim, Jozef Širáň, Janez Žerovnik: A counterexample to the uniform shortest path routing conjecture for vertex-transitive graphs, 38 (2000) e-sigma PDF PDF
682: Janez Žerovnik, Blaž Zmazek: Recognizing weighted directed Cartesian graph bundles, 38 (2000) e-sigma PDF PDF
681: Aleksander Vesel, Janez Žerovnik: Improved lower bound on Shannon capacity of $C_7$, 38 (2000) e-sigma PDF PDF
680: Blaž Zmazek, Janez Žerovnik: Behzad-Vizing conjecture is true for Cartesian product graphs, 38 (2000) e-sigma PDF PDF
679: Alain Bretto, Stephane Ubeda, Janez Žerovnik: A polynomial algorithm for the strong Helly property, 38 (2000) e-sigma PDF PDF
632: Aleksander Vesel, Janez Žerovnik: How good can ants color graphs?, 36 (1998) e-sigma PDF PDF
603: Patrick W. Fowler, Ante Graovac, Tomaž Pisanski, Janez Žerovnik: A generalized ring spiral algorithm for coding fullerenes and other cubic polyhedra, 36 (1998) e-sigma PDF PDF