General Session

Organizer: Tomaž Pisanski

1. Atheer Abbas (Malaysia)- On properties of triple loop graphs*
2. Robert Aldred (Department of Mathematics and Statistics, University of Otago, New Zealand) - Matching extendability of graphs in surfaces*
3. János Barát (University of Szeged, Hungary) - P₄-decomposition of graphs*
4. Miklos Bartha (Memorial University of Newfoundland) - Decision algorithms for deterministic soliton automata*
5. Faqir Bhatti (Lahore University of Management Sciences, Lahore, Pakistan) - Fermi walk configurations and Young Tableaux*
6. Sylwia Cichaz (AGH University of Science and Technology, Poland) - Arbitrarily decomposition into open and closed trails*
7. Paul Dorbec (UJF, France) - New bounds on paired- domination in graphs*
8. Tomislav Došlić (University of Zagreb, Croatia) - Vertex-weighted Wiener polynomials for composite graphs*
9. Stephen Graves (Syracuse University, USA) - Exponential Growth of Homogeneous Maps*
10. Marc Hellmuth (University of Leipzig, Germany) - Constrained RNA-folding*
11. František Kardoš (P. J. Šafárik University Košice, Slovakia) - Symmetries of fulleroids*
12. Martin Knor (Slovak University of Technology, Slovakia) - Connectivity properties in iterated line graphs*
13. Martin Kochol (University of Žilina, Slovakia) - Excluding girth of smallest counterexamples to the 5-flow conjecture*
14. Mark Korenblit (Holon Institute of Technology, Israel) - Fibonacci graphs and their shortest expressions*
15. Matjaž Kovše (IMFM, Slovenia) - Induced cycles in crossing graphs of median graphs*
16. Tadeja Kraner Šumenjak (University of Maribor, Slovenia) - Cube intersection concepts in median graphs*
17. Josef Leydold (WU Wien, Austria) - Largest Eigenvalues of Graphs with Given Degree Sequences*
18. Eyal Loz (University of Auckland, New Zealand) - New record graphs in the degree-diameter problem*
19. Primož Lukšič (University of Ljubljana, Slovenia) - Distance-residual subgraphs*
20. Tomáš Madaras (University of P.J.Šafárik in Košice, Slovakia) - On local properties of polyhedral graphs with prescribed edge- and dual edge- weight*
21. Bojan Mohar (IMFM, Ljubljana, Slovenia and SFU, Canada) - Eigenvalues of (3,6)-polyhedra*
22. Mike Newman (Charles University) - Quantum Chromatic Number of Graphs*
23. Marko Razpet (University of Ljubljana, Slovenia) - Delannoy paths of a given length*
24. Frank Ruskey (University of Victoria, Canada) - Symmetric Venn Diagrams on the Sphere*
25. Andrej Taranenko (University of Maribor, Slovenia) - Fast recognition of Fibonacci cubes*
26. Aleksandra Tepeh Horvat (IMFM, Slovenia) - On the geodetic number of median and Cartesian product graphs*
27. Zsolt Tuza (Hungarian Academy of Sciences and University of Pannonia) - Set systems that cross all partitions*
28. Aleksander Vesel (University of Maribor, Slovenia) - Characterization and $\tau$-graphs of elementary benzenoid graphs*
29. Ian Wanless (Monash University, Australia) - Matching polynomials and walks in regular graphs*
30. Janez Žerovnik (University of Maribor and IMFM, Slovenia) - Perfect codes in direct products of cycles - a complete characterization*

* - abstract received and accepted