On subgraphs of C2k-free graphs and a problem of Kühn and Osthus.
Dániel GrószAbhishek MethukuCasey TompkinsPublished in: Comb. Probab. Comput. (2020)
Keyphrases
- graph databases
- graph mining
- subgraph isomorphism
- labeled graphs
- subgraph matching
- graph properties
- connected subgraphs
- subgraph mining
- graph structures
- maximum common subgraph
- frequent subgraph mining
- reachability queries
- graph matching
- graph data
- maximum clique
- query graph
- graph theoretic
- graph patterns
- dense subgraphs
- random graphs
- frequent subgraphs
- topological information
- graph theory
- directed graph
- graph model
- series parallel
- maximal cliques
- edit distance
- graph structure
- weighted graph
- graph search
- pattern mining
- application domains
- quasi cliques
- data structure