Vertex partitions of non-complete graphs into connected monochromatic k-regular graphs.
Gábor N. SárközyStanley M. SelkowFei SongPublished in: Discret. Math. (2011)
Keyphrases
- directed graph
- graph matching
- labeled graphs
- graph structure
- vertex set
- undirected graph
- bipartite graph
- attributed graphs
- graph theory
- complex structures
- graph construction
- graph model
- connected subgraphs
- hamiltonian cycle
- series parallel
- maximal cliques
- graph kernels
- real time
- binary images
- pairwise
- web pages
- neural network
- data sets