On choosability with separation of planar graphs with lists of different sizes.

Hal A. Kierstead Bernard Lidický

Published in: Discret. Math. (2015)

Keyphrases

planar graphs
minimum weight
approximate inference
social networks
lower bound
higher order
maximum likelihood estimation
undirected graph
boundary points