The computational complexity of disconnected cut and 2 K 2 -partition (2015)
Attributed to:
Algorithmic Aspects of Graph Coloring
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1016/j.jctb.2014.09.002
Publication URI: http://dx.doi.org/10.1016/j.jctb.2014.09.002
Type: Journal Article/Review
Parent Publication: Journal of Combinatorial Theory, Series B