On Non-Hamiltonian Graphs for which every Vertex-Deleted Subgraph Is Traceable.
Carol T. ZamfirescuPublished in: J. Graph Theory (2017)
Keyphrases
- labeled graphs
- connected subgraphs
- graph databases
- graph mining
- subgraph isomorphism
- subgraph matching
- directed graph
- graph classification
- edge weights
- graph data
- graph properties
- undirected graph
- attributed graphs
- similarity function
- biological networks
- hamiltonian cycle
- frequent subgraph mining
- dense subgraphs
- frequent subgraphs
- directed acyclic graph
- regular expressions
- graph matching
- vertex set
- maximum cardinality
- subgraph mining
- bipartite graph
- graph coloring
- graph kernels
- graph theoretic
- weighted graph
- maximum clique
- connected components
- graph clustering
- average degree
- minimum weight
- social networks
- edit distance
- phase transition
- structured data