Vertex Partitions by Connected Monochromatic k-Regular Graphs.
Gábor N. SárközyStanley M. SelkowPublished in: J. Comb. Theory, Ser. B (2000)
Keyphrases
- vertex set
- directed graph
- undirected graph
- labeled graphs
- attributed graphs
- minimum weight
- maximum cardinality
- connected graphs
- connected subgraphs
- hamiltonian cycle
- connected components
- graph theory
- spanning tree
- random graphs
- neighborhood graph
- graph model
- graph matching
- data sets
- structured objects
- data mining
- edge weights
- graph theoretic
- weighted graph
- graph clustering
- strongly connected
- graph representation
- graph mining
- shortest path
- random walk
- object recognition
- social networks
- learning algorithm