Contractible edges and liftable vertices in a 4-connected graph.
Kiyoshi AndoPublished in: Discret. Math. (2022)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- directed edges
- directed graph
- vertex set
- connected components
- connected graphs
- spanning tree
- minimum weight
- graph model
- maximum matching
- adjacency matrix
- shortest path
- graph structure
- random graphs
- directed acyclic graph
- graph partitioning
- densely connected
- bipartite graph
- average degree
- real world graphs
- random walk
- graph representation
- graph theory
- approximation algorithms
- planar graphs
- strongly connected
- structured data
- strongly connected components
- connected subgraphs
- binary images
- nodes of a graph
- stable set
- social network analysis
- complex networks
- subgraph isomorphism
- neighborhood graph
- graph clustering
- minimum cost