Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs.
Pinar HeggernesDaniel MeisterCharis PapadopoulosPublished in: Discret. Appl. Math. (2012)
Keyphrases
- graph properties
- maximum clique
- quasi cliques
- graph mining
- graph databases
- graph theory
- labeled graphs
- graph structures
- graph theoretic
- reachability queries
- finite dimensional
- independent set
- maximal cliques
- subgraph mining
- frequent subgraph mining
- series parallel
- connected subgraphs
- association graph
- data structure
- graph data
- bipartite graph