Displaying similar documents to “The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars.”

Saturation numbers for trees.

Faudree, Jill, Faudree, Ralph J., Gould, Ronald J., Jacobson, Michael S. (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Extended trees of graphs

Bohdan Zelinka (1994)

Mathematica Bohemica

Similarity:

An extended tree of a graph is a certain analogue of spanning tree. It is defined by means of vertex splitting. The properties of these trees are studied, mainly for complete graphs.

Weak Saturation Numbers for Sparse Graphs

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson (2013)

Discussiones Mathematicae Graph Theory

Similarity:

For a fixed graph F, a graph G is F-saturated if there is no copy of F in G, but for any edge e ∉ G, there is a copy of F in G + e. The minimum number of edges in an F-saturated graph of order n will be denoted by sat(n, F). A graph G is weakly F-saturated if there is an ordering of the missing edges of G so that if they are added one at a time, each edge added creates a new copy of F. The minimum size of a weakly F-saturated graph G of order n will be denoted by wsat(n, F). The graphs...