Login / Signup
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree.
François Dross
Mickaël Montassier
Alexandre Pinlou
Published in:
CoRR (2016)
Keyphrases
</>
planar graphs
graph theoretic
learning algorithm
np complete
directed graph