Localizable graphs

Datum / Date: 14.12.15
Čas / Time: 10:00-11:00
Predavalnica / Location: FAMNIT-POŠTA
Predavatelj / Lecturer: Ademir Hujdurović (UP IAM, UP FAMNIT)
Naslov / Title: Localizable graphs
Povzetek / Abstract:

A clique in a graph is said to be strong if it intersects every maximal stable set. A graph is called localizable if it admits a partition of its vertex set into strong cliques. In this talk I will present some results regarding the complexity of recognizing localizable graphs. We will discuss when is the product (lexicographic or Cartesian) of two graphs localizable.

We will also discuss what does it mean for a vertex-transitive graph to have a strong clique.

This is a joint work with Martin Milanič and Bernard Ries.

Delite z drugimi

Podobne novice

Orodna vrstica za dostopnost

Powered by  GDPR Cookie Compliance (opens in a new tab)
Politika zasebnosti / Privacy Overview

Ta spletna stran uporablja piškotke, da vam lahko zagotovi najboljšo možno uporabniško izkušnjo. Informacije o piškotkih se shranjujejo v vašem brskalniku in omogočajo funkcije, kot je prepoznavanje ob vašem ponovnem obisku spletne strani, ter pomagajo naši ekipi razumeti, kateri deli spletne strani so za vas najbolj zanimivi in uporabni.

This website uses cookies so that we can provide you with the best user experience possible. Cookie information is stored in your browser and performs functions such as recognising you when you return to our website and helping our team to understand which sections of the website you find most interesting and useful.