Embedding a forest in a graph.
Goldberg, Mark K., Magdon-Ismail, Malik (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Induced trees in triangle-free graphs.”
Embedding a forest in a graph.
Relaxed graceful labellings of trees.
Van Bussel, Frank (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On -bounded families of graphs.
Gyárfás, András, Zaker, Manouchehr (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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...
One-two descriptor of graphs
K. CH. Das, I. Gutman, D. Vukičević (2011)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
A note on -free precolouring with colours.
Rackham, Tom (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Steiner distance in graphs
Gary Chartrand, Ortrud R. Oellermann, Song Lin Tian, Hung Bin Zou (1989)
Časopis pro pěstování matematiky
Similarity:
Subgraph isomorphism in planar graphs and related problems.
Eppstein, David (1999)
Journal of Graph Algorithms and Applications
Similarity:
Spanning trees with many leaves and average distance.
DeLaViña, Ermelinda, Waller, Bill (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On Graphs with Disjoint Dominating and 2-Dominating Sets
Michael A. Henning, Douglas F. Rall (2013)
Discussiones Mathematicae Graph Theory
Similarity:
A DD2-pair of a graph G is a pair (D,D2) of disjoint sets of vertices of G such that D is a dominating set and D2 is a 2-dominating set of G. Although there are infinitely many graphs that do not contain a DD2-pair, we show that every graph with minimum degree at least two has a DD2-pair. We provide a constructive characterization of trees that have a DD2-pair and show that K3,3 is the only connected graph with minimum degree at least three for which D ∪ D2 necessarily contains all vertices...