Bridgeless Cubic Graphs Are (7, 2)-Edge-Choosable.
Edita MácajováPublished in: SIAM J. Discret. Math. (2013)
Keyphrases
- weighted graph
- undirected graph
- minimum spanning trees
- edge detection
- edge information
- b spline
- edge detector
- graph matching
- graph mining
- graph theoretic
- adjacency graph
- structured objects
- minimum spanning tree
- graph representation
- edge map
- edge weights
- multiple scales
- directed graph
- random graphs
- series parallel
- strongly connected
- graph structure
- graph theory
- data sets