Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree.
Pilar CanoGuillem PerarnauOriol SerraPublished in: Electron. Notes Discret. Math. (2017)
Keyphrases
- graph mining
- weighted graph
- graph databases
- subgraph isomorphism
- graph properties
- subgraph matching
- undirected graph
- spanning tree
- labeled graphs
- reachability queries
- graph structures
- subgraph mining
- frequent subgraph mining
- maximum common subgraph
- connected subgraphs
- graph data
- graph matching
- pattern mining
- graph theoretic
- dense subgraphs
- frequent subgraphs
- edge information
- graph theory
- minimum spanning trees
- edge weights
- data structure
- graph representation
- maximum clique
- random graphs
- data objects
- topological information
- graph model
- query graph
- directed graph
- graph patterns
- adjacency graph
- graph structure
- graph search
- connected components
- quasi cliques