Login / Signup
The complexity of the chromatic sum problem on cubic planar graphs and regular graphs.
Michal Malafiejski
Published in:
Electron. Notes Discret. Math. (2001)
Keyphrases
</>
planar graphs
max cut
computational complexity
objective function
bipartite graph
em algorithm
graph model
undirected graph