Preprinti IMFM

Letnik 50 (2012)

1184: Emeric Deutsch, Sandi Klavžar: Computing Hosoya polynomials of graphs from primary subgraphs, 50 (2012)

1183: Marko Jakovac, Iztok Peterin: The b-chromatic index of a graph, 50 (2012)

1182: Jernej Azarija, Sandi Klavžar: Moore graphs and cycles are extremal graphs for convex cycles, 50 (2012)

1181: Polona Pavlič, Janez Žerovnik: Formulas for various domination numbers of products of paths and cycles, 50 (2012)

1180: Sergio Cabello: Stackelberg Shortest Path Tree Game, Revisited, 50 (2012)

1179: Bijo S. Anand, Manoj Changat, Iztok Peterin, Prasanth G. Narasimha-Shenoi: Some Steiner concepts on lexicographic products of graphs, 50 (2012)

1178: Jernej Azarija: Counting graphs with different numbers of spanning trees through the counting of prime partitions, 50 (2012)

1177: Janez Žerovnik: Remarks on Equating of Grades at Basic and Higher Level of Mathematics Achievement, 50 (2012)

1176: Matjaž Kovše, Peter Stanet: Adaptive identification in torii in triangular grids, 50 (2012)

1175: Sandi Klavžar, M. J. Nadjafi-Arani: Wiener index versus Szeged index in networks, 50 (2012)

1174: Sandi Klavžar, M. J. Nadjafi-Arani: Wiener index in weighted graphs via unification of Ѳ*-classes, 50 (2012)

1173: Aleksandar Ilić, Sandi Klavžar, Yoomi Rho: Parity index of binary words and powers of prime words, 50 (2012)

1172: Sergio Cabello, Bojan Mohar: Adding one edge to planar graphs makes crossing number and 1-planarity hard, 50 (2012)

1171: Boštjan Brešar, Jérémie Chalopin, Victor Chepoi, Tanja Gologranc, Damian Osajda: Bucolic complexes, 50 (2012)

1170: Sergio Cabello, Erin Wolf Chambers, Jeff Erickson: Multiple-Source Shortest Paths in Embedded Graphs, 50 (2012)

1169: Iztok Banič, Matevž Črepnjak, Matej Merhar, Uroš Milutinović, Tina Sovič: Ważewski's universal dendrite as an inverse limit with one set-valued bonding function, 50 (2012)

1168: Jernej Azarija: Sharp upper and lower bounds on the number of spanning trees in Cartesian product graphs, 50 (2012)