Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex.
George R. T. HendryC. J. KnickerbockerPatti Frazer LockMichael SheardPublished in: Discret. Math. (1998)
Keyphrases
- labeled graphs
- connected subgraphs
- connected components
- graph mining
- graph databases
- subgraph isomorphism
- graph properties
- directed graph
- undirected graph
- attributed graphs
- biological networks
- graph data
- subgraph matching
- similarity function
- graph structures
- graph kernels
- graph patterns
- directed acyclic graph
- subgraph mining
- hamiltonian cycle
- regular expressions
- bipartite graph
- reachability queries
- graph coloring
- dense subgraphs
- topological information
- neighborhood graph
- frequent subgraph mining
- average degree
- maximum cardinality
- edge weights
- graph theoretic
- graph structure
- maximum clique
- frequent subgraphs
- complex networks
- weighted graph
- branch and bound algorithm
- connected graphs