Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls.
Karl HeuerDeniz SarikayaPublished in: J. Graph Theory (2023)
Keyphrases
- graph mining
- subgraph isomorphism
- graph databases
- subgraph matching
- graph data
- graph properties
- labeled graphs
- reachability queries
- graph structures
- subgraph mining
- maximum common subgraph
- connected subgraphs
- maximum clique
- frequent subgraph mining
- frequent subgraphs
- graph patterns
- dense subgraphs
- data structure
- query graph
- maximal cliques
- graph matching
- graph search
- connected components
- quasi cliques
- graph theory
- topological information
- graph structure
- globally consistent
- community discovery
- graph theoretic
- relational data
- pattern mining