Diplomske naloge - Bojan Mohar

Naslov	Osnovna literatura	Op.	Težavnost
Subdivizije grafa K₅	W. Mader, 3n-5 edges do force a subdivision of K₅, Combinatorica 18 (1998) 569-595. W. Mader, Topological subgraphs in graphs of large girth, Combinatorica 18 (1998) 405-412.		10
Kritični grafi za barvanje povezav	A.G. Chetwind, A.J.W. Hilton, D.G. Hoffman, On the \Delta-subgraph of graphs which are critical with respect to the chromatic index, JCTB 40(1989) 240-245. D. Haile, Bounds on the size of critical edge-chromatic graphs, Ars Combin. 53 (1999) 85-96.		7
Spektri ravninskih (3,6)-kletk	P.W. Fowler, P.E. John, H. Sachs, (3,6)-cages, hexagonal toroidal cages, and their spectra, DIMACS Series, Vol 51, 2000, pp. 139-174.		8-10
Brooksov izrek za grafe brez kratkih ciklov	J.H. Kim, On Brooks’ theorem for sparse graphs, Combin. Probab. Comput 4 (1995) 97-132. Johanssen		10
Diracov izrek za seznamska barvanja	A.V. Kostochka, M. Stiebitz, A list version of Dirac’s theorem on the number of edges in colour-critical graphs, rokopis (1999)	Rudi Valenčič 3.7.2000	8
Eliptične krivulje v kriptografiji		5.4.2001	9
Aciklična barvanja grafov v ravnini in projektivni ravnini	Borodin	Jure Meh april 2003	9
Povsod neničelni pretoki v grafih	M. Devos, Matrix choosability, JCTA 90 (2000)	Borut Kac, dec 03	8-9
Drevesna širina grafa	J. Chlebikova, The structure of obstructions to treewidth and pathwidth, rokopis (1999) Bruce Reed:		8
Min-max karakterizacija drevesne širine	P.D. Seymour, R. Thomas, Graph searching and a min-max theorem for tree-width, J. Combin. Theory Ser. B 58 (1993) 22-33.		8
Mreže in grafi z veliko drevesno širino	R. Diestel, T.R. Jensen, K.Y. Gorbunov, C. Thomassen, Highly connected sets and the excluded grid theorem, J. Combin. Theory, Ser. B 75 (1999) 61-73.		9
Grafi, pokriti s popolnimi prirejanji	M.H. Carvalho, C.L. Lucchesi, U.S.R. Murty, Ear decompositions of matching covered graphs, Combinatorica 19 (1999) 151-174.		8
Erdos-Szekeresev problem o konveksnih točkah	W. Morris, V. Soltan, The Erdos-Szekeres problem on points in convex position – A survey, Bull. AMS (2000)		8
Spodnje meje časovne kompleksnosti problemov	S. Jukna, A. Razborov, P. Savicky, I. Wegener, On P versus NP $\cap$ co-NP for decision trees and read-once branching programs, Comput. Complexity 8 (1999) 357-370.		8-10
Presečno število grafa	J. Pach, Which crossing number is it anyway?	Matjaž Urbanek 22.7.02	7-9
Najkrajši cikli pri problemu dvojnega pokritja	Huck		10