A charcterization of 4-edge-connected eulerian graphs.
Peter WeidlPublished in: J. Graph Theory (1995)
Keyphrases
- weighted graph
- undirected graph
- minimum spanning trees
- edge detection
- connected components
- edge information
- neighborhood graph
- edge detector
- graph matching
- graph theory
- graph theoretic
- connected graphs
- vertex set
- edge weights
- spanning tree
- graph databases
- graph mining
- graph model
- graph clustering
- directed graph
- minimum cost
- graph representation
- graph structure
- graph construction
- shortest path
- structured objects
- object recognition
- data sets