Tight bounds on the chromatic sum of a connected graph.
Carsten ThomassenPaul ErdösYousef AlaviParesh J. MaldeAllen J. SchwenkPublished in: J. Graph Theory (1989)
Keyphrases
- tight bounds
- upper bound
- connected components
- graph theory
- connected graphs
- neighborhood graph
- color images
- random walk
- weighted graph
- graph representation
- graph model
- directed graph
- graph structure
- stable set
- bipartite graph
- data sets
- directed acyclic graph
- graph mining
- graph matching
- weighted sum
- graph databases
- web pages
- graph based algorithm
- image processing
- data structure
- graph construction
- edge weights
- graph theoretic
- lower bound
- spanning tree
- knn