Not Every 2-tough Graph Is Hamiltonian.
Douglas BauerHajo BroersmaHenk Jan VeldmanPublished in: Discret. Appl. Math. (2000)
Keyphrases
- graph structure
- graph model
- directed acyclic graph
- random walk
- directed graph
- bipartite graph
- graph theory
- graph search
- information retrieval
- graph theoretic
- graph matching
- multiscale
- constraint satisfaction problems
- data sources
- evolutionary algorithm
- graph mining
- graph databases
- graph partitioning
- graph representation
- feature selection
- graph data
- information systems