Claw-Free and N(2, 1, 0)-Free Graphs are Almost Net-Free.

Michitaka Furuya Shoichi Tsuchiya

Published in: Graphs Comb. (2015)

Keyphrases

database
neural network

knowledge base
pattern recognition

lower bound

random walk