Edges not contained in triangles and the number of contractible edges in a 4-connected graph.
Kiyoshi AndoYoshimi EgawaPublished in: Discret. Math. (2008)
Keyphrases
- undirected graph
- directed graph
- nodes of a graph
- edge weights
- directed edges
- spanning tree
- small number
- weighted graph
- connected graphs
- random walk
- edge information
- connected components
- massive graphs
- bipartite graph
- directed acyclic graph
- binary images
- graph representation
- social networks
- approximation algorithms
- spectral embedding
- graph clustering
- structured data
- graph partitioning
- minimum cost
- graph model