The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Subgraph isomorphism in planar graphs and related problems.”

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...

L(2, 1)-Labelings of Some Families of Oriented Planar Graphs

Sagnik Sen (2014)

Discussiones Mathematicae Graph Theory

Similarity:

In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.