Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph.
Yoshimi EgawaShunsuke NakamuraPublished in: Discret. Appl. Math. (2024)
Keyphrases
- undirected graph
- directed graph
- edge weights
- weighted graph
- random graphs
- vertex set
- directed acyclic graph
- directed edges
- small number
- spanning tree
- graph structure
- nodes of a graph
- connected graphs
- connected components
- bipartite graph
- approximation algorithms
- computational complexity
- edge detector
- random walk
- data sets
- edge information
- structured data