Nowhere-zero 3-flow and -connectedness in graphs with four edge-disjoint spanning trees.
Miaomiao HanHong-Jian LaiJiaao LiPublished in: J. Graph Theory (2018)
Keyphrases
- spanning tree
- edge disjoint
- minimum spanning tree
- minimum cost
- minimum spanning trees
- undirected graph
- weighted graph
- connected components
- minimum weight
- total length
- flow patterns
- minimum total cost
- lowest cost
- edge weights
- root node
- graph theoretic
- high level
- flow field
- binary images
- graphical models
- dimensionality reduction