On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph.
Nicolas TrotignonKristina VuskovicPublished in: J. Graph Theory (2017)
Keyphrases
- labeled graphs
- query graph
- connected subgraphs
- edge weights
- graph databases
- weighted graph
- graph mining
- graph data
- subgraph isomorphism
- graph mining algorithms
- graph properties
- adjacency matrix
- graph classification
- subgraph matching
- graph search
- graph kernels
- dense subgraphs
- bipartite graph
- undirected graph
- graph structures
- random graphs
- graph model
- frequent subgraph mining
- biological networks
- directed graph
- regular expressions
- graph matching
- graph patterns
- maximum clique
- average degree
- connected graphs
- maximum weight
- attributed graphs
- directed edges
- directed acyclic graph
- subgraph mining
- maximal cliques
- graph theory
- frequent subgraphs
- spanning tree
- vertex set
- graph clustering
- graph structure
- graph representation
- graph partitioning
- graph isomorphism
- structured data
- similarity graph
- social networks
- series parallel
- graph theoretical
- graph construction
- minimum spanning tree
- link prediction
- relational data
- connected components