A complete grammar for decomposing a family of graphs into 3-connected components.
Chapuy, Guillaume, Fusy, Éric, Kang, Mihyun, Shoilekova, Bilyana (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The structure of locally finite two-connected graphs.”
A complete grammar for decomposing a family of graphs into 3-connected components.
Decomposing infinite 2-connected graphs into 3-connected components.
Richter, R. Bruce (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tree-thickness and caterpillar-thickness under girth constraints.
Liu, Qi, West, Douglas B. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Subgraph isomorphism in planar graphs and related problems.
Eppstein, David (1999)
Journal of Graph Algorithms and Applications
Similarity:
Two extremal problems in graph theory.
Brualdi, Richard A., Mellendorf, Stephen (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On external-memory planar depth first search.
Arge, Lars, Meyer, Ulrich, Toma, Laura, Zeh, Norbert (2003)
Journal of Graph Algorithms and Applications
Similarity:
Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings.
Bernardi, Olivier (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on circuit graphs.
Cui, Qing (2010)
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...
A note on the computational complexity of computing the edge rotation distance between graphs
Mirko Křivánek (1988)
Časopis pro pěstování matematiky
Similarity: