Extendability of certain graph products

Datum / Date: 21.11.16
Čas / Time: 10:00-11:00
Predavalnica / Location: FAMNIT-POŠTA
Predavatelj / Lecturer: Nina Chiarelli
Naslov / Title: Extendability of certain graph products
Povzetek / Abstract:

A graph G of even order is k-extendable if it has at least 2 k+2 vertices, contains a matching of size k, and if every k-matching is contained in a perfect matching of G. In the talk we will discuss 1-extendability and 2-extendability of Cartesian product of graphs and lexicographic products of graphs.

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.