Detecting and Enumerating Small Induced Subgraphs in $c$-Closed Graphs
Data Structures and Algorithms
2020-07-24 v1 Discrete Mathematics
Abstract
Fox et al. [SIAM J. Comp. 2020] introduced a new parameter, called -closure, for a parameterized study of clique enumeration problems. A graph is -closed if every pair of vertices with at least common neighbors is adjacent. The -closure of is the smallest such that is -closed. We systematically explore the impact of -closure on the computational complexity of detecting and enumerating small induced subgraphs. More precisely, for each graph on three or four vertices, we investigate parameterized polynomial-time algorithms for detecting and for enumerating all occurrences of in a given -closed graph.
Cite
@article{arxiv.2007.12077,
title = {Detecting and Enumerating Small Induced Subgraphs in $c$-Closed Graphs},
author = {Tomohiro Koana and André Nichterlein},
journal= {arXiv preprint arXiv:2007.12077},
year = {2020}
}