Subgraph isomorphism in planar graphs and related problems.
Eppstein, David (1999)
Journal of Graph Algorithms and Applications
Similarity:
Eppstein, David (1999)
Journal of Graph Algorithms and Applications
Similarity:
Maheshwari, Anil, Zeh, Norbert (2004)
Journal of Graph Algorithms and Applications
Similarity:
Boyer, John M., Myrvold, Wendy J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Felsner, Stefan, Liotta, Giuseppe, Wismath, Stephen (2003)
Journal of Graph Algorithms and Applications
Similarity:
Erten, Cesim, Kobourov, Stephen G. (2005)
Journal of Graph Algorithms and Applications
Similarity:
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...
Suderman, Matthew, Whitesides, Sue (2005)
Journal of Graph Algorithms and Applications
Similarity:
Bohdan Zelinka (1985)
Časopis pro pěstování matematiky
Similarity:
Cabello, Sergio, Van Kreveld, Marc, Liotta, Giuseppe, Meijer, Henk, Speckmann, Bettina, Verbeek, Kevin (2011)
Journal of Graph Algorithms and Applications
Similarity:
Van Bussel, Frank (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity: