A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results

Narayan Vikas. A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results. J. Comput. Syst. Sci., 71(4):406-439, 2005. [doi]

Abstract

Abstract is missing.