This is a summary of the author's Ph.D. thesis supervised by Sara Nicoloso and Gianpaolo Oriolo and defended on 3 April 2008 at Sapienza UniversitA di Roma. The thesis is written in English and is available from the author upon request. This work deals with three classical combinatorial problems, namely the isomorphism, the vertex-coloring and the stable set problem, restricted to two graph classes, namely circulant and claw-free graphs. In the first part (joint work with Sara Nicoloso), we derive a necessary and sufficient condition to test isomorphism of circulant graphs, and give simple algorithms to solve the vertex-coloring problem on this class of graphs. In the second part (joint work with Gianpaolo Oriolo and Gautier Stauffer), we propose a new combinatorial algorithm for the maximum weighted stable set problem in claw-free graphs, and devise a robust algorithm for the same problem in the subclass of fuzzy circular interval graphs, which also provides recognition when the stability number is greater than three.
Some classical combinatorial problems on circulant and claw-free graphs: the isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs / Pietropaoli, Ugo. - In: 4OR. - ISSN 1619-4500. - STAMPA. - 7:3(2009), pp. 297-300. [10.1007/s10288-008-0091-7]
Some classical combinatorial problems on circulant and claw-free graphs: the isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs
PIETROPAOLI, UGO
2009
Abstract
This is a summary of the author's Ph.D. thesis supervised by Sara Nicoloso and Gianpaolo Oriolo and defended on 3 April 2008 at Sapienza UniversitA di Roma. The thesis is written in English and is available from the author upon request. This work deals with three classical combinatorial problems, namely the isomorphism, the vertex-coloring and the stable set problem, restricted to two graph classes, namely circulant and claw-free graphs. In the first part (joint work with Sara Nicoloso), we derive a necessary and sufficient condition to test isomorphism of circulant graphs, and give simple algorithms to solve the vertex-coloring problem on this class of graphs. In the second part (joint work with Gianpaolo Oriolo and Gautier Stauffer), we propose a new combinatorial algorithm for the maximum weighted stable set problem in claw-free graphs, and devise a robust algorithm for the same problem in the subclass of fuzzy circular interval graphs, which also provides recognition when the stability number is greater than three.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.