1-Tough cocomparability graphs are hamiltonian.
Jitender S. DeogunDieter KratschGeorge SteinerPublished in: Discret. Math. (1997)
Keyphrases
- graph matching
- graph theory
- neural network
- graph mining
- graph structure
- series parallel
- graph theoretical
- graph coloring
- graph clustering
- graph databases
- data sets
- scheduling problem
- relational databases
- graph representation
- graph theoretic
- search algorithm
- graph construction
- image segmentation
- machine learning
- real world
- graph isomorphism