Large Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition.
András GyárfásGábor N. SárközyPublished in: Electron. J. Comb. (2017)
Keyphrases
- weighted graph
- undirected graph
- edge information
- random graphs
- graph theoretic
- spanning tree
- edge detection
- sufficient conditions
- minimum cost
- graph clustering
- building blocks
- graph model
- pattern recognition
- minimum spanning trees
- graph theory
- directed graph
- lower bound
- graph mining
- graph matching
- edge map
- graph partitioning
- graph representation
- power law
- np hard
- vertex set
- adjacency graph
- data sets
- square error
- connected dominating set