Category Seminars

Finite CI-groups and Schur rings

2014-10-27 10:00-10:45 FAMNIT-SEMIN Istvan Kovacs (UP FAMNIT) Finite CI-groups and Schur rings A Cayley graph Cay(G,S) is called a CI-graph if for every subset Tof G, if Cay(G,T) and Cay(G,S) are isomorphic, then T=f(S) for some automorphism f of G.…

Generalized Cayley graphs

2014-10-20 10:00-10:45 FAMNIT-SEMIN Ademir Hujdurović Generalized Cayley graphs Generalized Cayley graphs were defined by D.Marušič, R. Scapellato and N. Zagaglia Salvi in 1992. They studied properties of such graphs, mostly related to double coverings of graph. They also posed a…

Minimum weight clique cover in claw-free perfect graphs

2014-10-06 10:00-11:00 FAMNIT-SEMIN Dr. Flavia Bonomo (Buenos Aires University, Argentina) Minimum weight clique cover in claw-free perfect graphs For a perfect graph G, and given a weight function w on the vertices of G, linear programming duality ensures that the weight of…

Finding (Shortest) Paths between Graph Colourings

2014-09-29 10:00-11:00 FAMNIT-SEMIN Dr Matthew Johnson (Durham University, UK) Finding (Shortest) Paths between Graph Colourings  The reconfiguration graph of the $k$-colourings of a graph $G$ contains as its vertex set the proper vertex $k$-colourings of $G$, and two colourings are…

Verifiable information: the problem of communication

2014-06-09 10:00-11:00 FAMNIT-SEMIN Slobodan Danko Bosanac (Ruđer Bošković Institute, Croatia) Verifiable information: the problem of communication Exchange of information occurs on all levels of living matter, and it is the basis without which life could not be developed, especially on the…

A CENTURY OF GRAPH THEORY

2014-06-11 11:00-12:00 FAMNIT-VP prof. dr. Robin Wilson (Open University, United Kingdom) A CENTURY OF GRAPH THEORY Graph theory has changed completely from the late-19th century to the late 20th century, from a collection of mainly recreational problems to a well-developed…

Accessibility Toolbar