Graph Theory Afternoon in Ljubljana
Graph theory and algorithms seminar
10. 12. 2008
Martin Juvan: Fisherjev model trga in ravnovesne cene
četrtek 4. 12. 2008 ob 12:30 v 3.07 na Jadranski 21
Graph theory and algorithms seminar
3. 12. 2008
M. Stehlik: 4-coloring of triangle-free graphs on the double torus; O. Rutcky: 3-colorings of graphs with odd cylces only of sizes 5 and 7
četrtek ob 12:30 v 3.07 na Jadranski 21
Graph theory and algorithms seminar
24. 11. 2008
Fijavž Gašper - Triangulacije in K6 minorji
Graph theory and algorithms seminar
18. 11. 2008
23th Leoben-Ljubljana Seminar
Graph theory and algorithms seminar
13. 11. 2008
Rok Erman: Long cycles in fullerene graphs
Graph theory and algorithms seminar
3. 11. 2008
R. Škrekovski: Alon-Tarsi Thm
Graph theory and algorithms seminar
28. 10. 2008
Rok Erman: Cyclic colorings of plane graphs
Graph theory and algorithms seminar
21. 10. 2008
Martin Tancer: d-collapsibility is NP-complete for d greater or equal to 4
Abstract: A simplicial complex is d-collapsible if it can be reduced to
an empty complex by repeatedly removing (collapsing) a face of dimension
at most d-1 that is contained in a unique maximal face. We prove that the
algorithmic question whether a given simplicial complex is d-collapsible
is NP-complete for d greater or equal to 4 and polynomial time solvable
for d at most 2.
As an intermediate step, we prove that d-collapsibility can be recognized
by the greedy algorithm for d at most 2, but the greedy algorithm does not
work for d greater or equal 3.
Graph theory and algorithms seminar
15. 10. 2008
Sandi Klavžar: Novejši rezultati o strukturi kartezičnih produktov grafov
Graph theory and algorithms seminar
7. 10. 2008
R. Skrekovski: Planar graphs without 3-,7-,8-cycles are 3-choosable
Thursday, October 2, 2008, at 12:15 in room 3.07, Jadranska 21
Graph theory and algorithms seminar
30. 9. 2008
Robert Samal in Bojan Mohar
Monday (!!), September 15, 2008, at 12:15 in room PS, Jadranska 19
Graph theory and algorithms seminar
11. 9. 2008
Bojan Mohar: Extremal results for the sum of k largest eigenvalues of graphs
Thursday, May 29, 2008, at 12:15 in room PS, Jadranska 19
Graph theory and algorithms seminar
26. 5. 2008
Andrej Vodopivec: The genus of Petersen powers
Thursday, May 22, 2008, at 12:15 in room PS, Jadranska 19
Graph theory and algorithms seminar
19. 5. 2008
Petr Gregor: Perfect parallel-edge-dominating coloring of the hypercube and Turan-type problems
Thursday, May 8, 2008, at 12:15 in room PS, Jadranska 19
Graph theory and algorithms seminar
6. 5. 2008
Sandi Klavžar: Convex excess and Euler-type inequality for partial cubes
Thursday, April 24, 2008, at 12:15 in room PS, Jadranska 19
Graph theory and algorithms seminar
22. 4. 2008
Rok Pozar: A simple Gray code to list all minimal signed binary representations
Thursday, April 17, 2008, at 12:15 in room PS, Jadranska 19
Graph theory and algorithms seminar
16. 4. 2008
Gašper Fijavž: Struktura minor minimalnih grafov za minimalno stopnjo
Thursday, April 10, 2008, at 12:15 in room PS, Jadranska 19
Graph theory and algorithms seminar
8. 4. 2008
Andrej Brodnik: Ali je 2 x 1D boljše od 2D?
Thursday, April 3, 2008, at 12:15 in room PS, Jadranska 19
Graph theory and algorithms seminar
2. 4. 2008
Gabriel Verret: Arc-transitive graphs
Thursday, March 27, 2008, at 12:15 in room PS, Jadranska 19
Graph theory and algorithms seminar
24. 3. 2008
