Login / Signup
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth.
Thomas Emden-Weinert
Stefan Hougardy
Bernd Kreuter
Published in:
Comb. Probab. Comput. (1998)
Keyphrases
</>
graph matching
directed graph
graph theoretic
labeled graphs
graph clustering
graph databases
graph mining
graph structure
subgraph isomorphism
maximal cliques
graph representation
database
graph theory
np complete
worst case
pairwise
genetic algorithm
data sets