On the NP-completeness of the k-colorability problem for triangle-free graphs.

Frédéric Maffray Myriam Preissmann

Published in: Discret. Math. (1996)

Keyphrases

graph mining
directed graph
structured objects
graph matching
data mining
series parallel
real time
multiscale
data structure
lower bound
pairwise
np hard
complex networks
knowledge base
graph structure
real world
graph model
graph partitioning
graph theoretic
random graphs