Graphs with valency k, edge connectivity k, chromatic index k + 1 and arbitrary girth.
Vance FaberJan MycielskiPublished in: Discret. Math. (1973)
Keyphrases
- weighted graph
- strongly connected
- undirected graph
- minimum spanning trees
- color images
- directed graph
- edge weights
- edge detection
- edge information
- database
- indexing method
- graph clustering
- graph databases
- graph structure
- graph matching
- graph connectivity
- graph theoretic
- topological information
- vertex set
- graph partitioning
- graph model
- graph theory
- bipartite graph
- color information
- edge detector
- connected components
- index structure
- edge map
- topological features
- query graph
- adjacency graph
- image processing
- neural network