ABSTRACT: A graph that consists of t cliques sharing a vertex v is said to be a t-friendship graph with center v. A friendship graph is a graph that is t-friendship for some . We solve the problem of ...

Script with Prim and Floyd algo are in the prim_kruskal.py file in main folder. And our Classifier algo is in tree.py file. Other files are for conclusion.

Departamento de Matem atica and Centro de Matem atica e Aplica c~oes Faculdade de Ci^encias e Tecnologia, Universidade Nova de Lisboa Quinta da Torre, 2829-516 Caparica, Portugal. A friendship graph ...

February 5 !!! CANCELED!!! Matthieu Plumettaz (Columbia) On the Erdos-Lovasz Tihany Conjecture for Claw-Free Graphs February 12 !!! PLEASE NOTE THE CHANGE DUE TO WEATHER!!! Matthieu Plumettaz ...