Results 191 to 200 of about 2,245 (216)
Some of the next articles are maybe not open access.
Journal of Graph Theory, 1985
AbstractThe graphs called 2‐trees are defined by recursion. The smallest 2‐tree is the complete graph on 2 vertices. A 2‐tree on n + 1 vertices (where n ≥ 2) is obtained by adding a new vertex adjacent to each of 2 arbitrarily selected adjacent vertices in a 2‐tree on n vertices.
openaire +1 more source
AbstractThe graphs called 2‐trees are defined by recursion. The smallest 2‐tree is the complete graph on 2 vertices. A 2‐tree on n + 1 vertices (where n ≥ 2) is obtained by adding a new vertex adjacent to each of 2 arbitrarily selected adjacent vertices in a 2‐tree on n vertices.
openaire +1 more source
Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101), 2000
Bei Tang +2 more
openaire +2 more sources
Bei Tang +2 more
openaire +2 more sources

