Weekly outline

  • General

  • 22 November - 28 November

    • Jelena Sedlar: Remarks on the local irregularity conjecture

    • Tuesday, November 23rd, at 10:15

  • 29 November - 5 December

    • Sergio Cabello

    • Tuesday, November 30th, at 10:15

  • 6 December - 12 December

    • Snježana Majstorović

    • Tuesday, December 7th, at 10:15

  • 13 December - 19 December

    • 2021 Symposium on Modern Graph Theory

    • Monday, December 13th - Friday, December 17th

  • 20. december - 27. december

    • Bojan Mohar

    • Tuesday, December 21st, at 10:15

  • 27 December - 2 January

    • 3 January - 9 January

      • 10 January - 16 January

        • 17 January - 23 January

          • 24 January - 30 January

            • 31 January - 6 February

              • 7 February - 13 February

                • 14 February - 20 February

                  • 21 February - 27 February

                    • 28 February - 6 March

                      • 7 March - 13 March

                        • 14 March - 20 March

                          • 21 March - 27 March

                            Sandi Klavžar: Mutual-visibility in graphs

                            • 28 March - 3 April

                              Sandi Klavžar: Mutual-visibility in graphs II

                              • 4 April - 10 April

                                Monika Pilśniak: Proper distinguishing arc-colourings of symmetric digraphs

                                A symmetric digraph G↔ arises from a simple graph G by substituting each edge uv by a pair of opposite arcs uv→,vu→. An arc-colouring c of G↔ is distinguishing if the only automorphism of G↔ preserving c is the identity. We study distinct types of proper arc-colourings of G↔ corresponding to four definitions of adjacency of arcs. For each type, we investigate the distinguishing chromatic index of G↔, i.e. the least number of colours in a distinguishing proper colouring of G↔. We also determine tight bounds for chromatic indices of G↔, i.e. for the least numbers of colours in each type of proper colourings.


                                • 11 April - 17 April

                                  Gašper Domen Romih: Cut method for hypertrees

                                  We investigate the cut method for calculating Wiener index of hypergraphs or more precisley tree hypergraphs. Motivation and some basic results will be presented.

                                  • 18 April - 24 April

                                    Mike Henning: Bounds on domination parameters in graphs: a brief survey

                                    In this talk we present a brief survey of bounds on the (total) domination number of a graph in terms of its order and minimum degree.

                                    • 25 April - 1 May

                                      • 2 May - 8 May

                                        • 9 May - 15 May

                                          Mike Henning: Bounds on domination parameters in graphs: a brief survey


                                          Abstract: In this talk we present a brief survey of bounds on the domination number of a graph in terms of its order and minimum degree.

                                          • 16 May - 22 May

                                            ??

                                            • 23 May - 29 May

                                              Antonio Montero


                                              • 30 May - 5 June

                                                Bojan Mohar

                                                • 6 June - 12 June

                                                  • 13 June - 19 June

                                                    • 20 June - 26 June