Login / Signup
Colorings of infinite graphs without one-colored rays.
Norbert Polat
Published in:
J. Graph Theory (1996)
Keyphrases
</>
graph matching
directed graph
graph mining
graph theoretic
genetic algorithm
graph coloring
random graphs
graph theory
d scene
pattern recognition
simulated annealing
graph model
undirected graph
graph partitioning
bayesian networks
data sets
series parallel
structured objects