Login / Signup
A sufficient condition for planar graphs to be acyclically 5-choosable.
Min Chen
André Raspaud
Published in:
J. Graph Theory (2012)
Keyphrases
</>
sufficient conditions
planar graphs
exponential stability
minimum weight
linear complementarity problem
lyapunov function
approximate inference
closed form
weighted graph
undirected graph