Login / Signup
Size of the largest induced forest in subcubic graphs of girth at least four and five.
Tom Kelly
Chun-Hung Liu
Published in:
J. Graph Theory (2018)
Keyphrases
</>
maximal cliques
graphical models
graph matching
standard deviation
graph mining
graph model
neural network
real world
machine learning
information systems
optimal solution
bipartite graph
graph theory
small size
series parallel