J. Bang-Jensen and B. Toft. Unsolved problems presented at the Julius Petersen Graph Theory Conference. Discrete Math., 101(1-3): 351-360, 1992. doi:10.1016/0012-365X(92)90616-N

has been cited by the following article:

• TITLE: Greedy Friensdhip Decompositions of Graphs

  AUTHORS: Teresa Sousa

  KEYWORDS: Friendship Graph, Decompositions, Greedy Decompositions

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.1 No.1, April 8, 2011

  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 finding the best upper bound for the size of a greedy 2-friendship decomposition and a greedy friendship decomposition of graphs of order n.