Login / Signup
A sufficient condition for a planar graph to be 3-choosable.
Liang Shen
Yingqian Wang
Published in:
Inf. Process. Lett. (2007)
Keyphrases
</>
sufficient conditions
planar graphs
lyapunov function
higher order
exponential stability
optimal solution
high dimensional
linear programming