Hereditary classes of cubic graphs

Supervisor
Vahan Mkrtchyan - Department of Informatics and Applied Mathematics, Yerevan State University, Armenia
Date and time
Wednesday, July 6, 2016 at 5:15 PM
Place
Ca' Vignal - Piramide, Floor 0, Hall Verde
Programme Director
External reference
Giuseppe Mazzuoccolo
Publication date
May 4, 2016
Department
Computer Science  

Summary

If G and H are cubic graphs, then we will write H<G, if the edges of G can be colored with edges of H, such that any 3 mutually adjacent edges of G are colored with 3 mutually adjacent edges of H. If M is a family of cubic graphs, then we will say that M is hereditary, if H < G and H in M implies that G belongs to M. A finite basis B of a hereditary class M, is a finite subset of M, such that for any cubic graph G one has: G belongs to M if and only if there is a cubic graph H of B, such that H<G. We will consider some hereditary classes of cubic graphs and present conjectures about their finite bases. We will also discuss the relationship among those conjectures.





© 2002 - 2021  Verona University
Via dell'Artigliere 8, 37129 Verona  |  P. I.V.A. 01541040232  |  C. FISCALE 93009870234