On forbidden induced subgraphs for K1, 3-free perfect graphs.
Christoph BrausePremysl HolubAdam KabelaZdenek RyjácekIngo SchiermeyerPetr VránaPublished in: Discret. Math. (2019)
Keyphrases
- graph mining
- graph databases
- graph properties
- subgraph isomorphism
- subgraph matching
- connected subgraphs
- labeled graphs
- graph structures
- graph data
- subgraph mining
- maximum common subgraph
- reachability queries
- frequent subgraph mining
- directed graph
- query graph
- graph matching
- maximum clique
- graph representation
- graph patterns
- frequent subgraphs
- graph theory
- graph partitioning
- topological information
- dense subgraphs
- edit distance
- data structure
- graph theoretic
- quasi cliques
- biological networks
- regular expressions
- weighted graph
- maximal cliques
- graph clustering