How many disjoint 2-edge paths must a cubic graph have?
Alexander K. KelmansDhruv MubayiPublished in: J. Graph Theory (2004)
Keyphrases
- disjoint paths
- weighted graph
- undirected graph
- shortest path
- directed graph
- graph theory
- edge weights
- edge information
- approximation algorithms
- graph structure
- edge detection
- random walk
- graph representation
- bipartite graph
- graph partitioning
- minimum spanning tree
- graph construction
- path length
- connected components
- structured data
- image processing
- search engine
- strongly connected
- adjacency matrix
- graph based algorithm
- vertex set
- stable set
- minimum cost path
- graph theoretic
- graph model
- graph matching
- complex networks
- path planning
- pairwise
- bayesian networks
- web pages