The Graph of Triangulations of a Point Configuration with d +4 Vertices Is 3-Connected.
M. AzaolaFrancisco SantosPublished in: Discret. Comput. Geom. (2000)
Keyphrases
- connected graphs
- weighted graph
- connected components
- directed edges
- hamiltonian cycle
- undirected graph
- attributed graphs
- graph matching
- planar graphs
- labeled graphs
- vertex set
- adjacency matrix
- edge weights
- minimum weight
- directed graph
- average degree
- maximum matching
- stable set
- random graphs
- bipartite graph
- graph theory
- graph structure
- neighborhood graph
- shortest path
- maximal cliques
- random walk
- graph theoretic
- graph representation
- strongly connected
- maximum cardinality
- spanning tree
- graph mining
- link analysis
- minimum spanning tree
- betweenness centrality
- graph structures
- approximation algorithms
- structured data