On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs.
Matthias KriesellPublished in: Discret. Math. (2010)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- graph properties
- subgraph matching
- connected subgraphs
- reachability queries
- labeled graphs
- graph data
- maximum common subgraph
- graph structures
- subgraph mining
- graph patterns
- maximum clique
- topological information
- frequent subgraph mining
- quasi cliques
- dense subgraphs
- query graph
- graph matching
- frequent subgraphs
- undirected graph
- graph theoretic
- series parallel
- neural network
- graph search
- pattern mining
- data structure
- graph theory
- directed graph
- link prediction
- bipartite graph
- maximal cliques
- graph kernels
- graph clustering
- biological networks