Odd coloring of sparse graphs and planar graphs.

Eun-Kyung Cho Ilkyoo Choi Hyemin Kwon Boram Park

Published in: Discret. Math. (2023)

Keyphrases

planar graphs
max cut
minimum weight
high dimensional
bipartite graph
approximate inference
weighted graph
knapsack problem