A Degree Sum Condition for the Existence of a Contractible Edge in a kappa-Connected Graph.
Matthias KriesellPublished in: J. Comb. Theory, Ser. B (2001)
Keyphrases
- weighted graph
- connected components
- undirected graph
- edge weights
- disjoint paths
- graph representation
- random graphs
- strongly connected
- directed graph
- vertex set
- random walk
- edge information
- graph structure
- graph theory
- connected graphs
- graph model
- structured data
- objective function
- graph data
- neighborhood graph
- clustering coefficient
- graph theoretic
- spanning tree
- data sets
- directed acyclic graph
- graphical models
- edge detection
- graph partitioning
- graph mining
- minimum spanning tree
- graph clustering
- bipartite graph
- dependency graph
- approximation algorithms
- level set
- graph based algorithm
- complementarity problems
- multiscale