M-Completeness Is Seldom Monadic Over Graphs (2000)

by J. Adámek , G.M. Kelly
Venue:THEORY APPL. CATEG
Citations:1 - 0 self