Abstract We study kernelization of classic hard graph problems when the input graphs fulfill triadic closure properties. More precisely, we consider recently introduced parameters number c and weak $$\gamma $$ ? (Fox et al. SIAM J Comput 49(2):448–464, 2020) in addition to standard parameter solution size k ....
