Login / Signup
A counterexample to the conjecture of Aksionov and Mel'nikov on non-3-colorable planar graphs.
Han-Kun Ma
Published in:
J. Comb. Theory, Ser. B (1984)
Keyphrases
</>
planar graphs
minimum weight
approximate inference
lower bound
probability distribution
least squares
binary images
piecewise linear
partition function