Packing independent cliques into planar graphs
Combinatorics
2025-09-08 v2
Abstract
The indeque number of a graph is largest set of vertices that induce an independent set of cliques. We study the extremal value of this parameter for the class and subclasses of planar graphs, most notably for forests and graphs of pathwidth at most .
Keywords
Cite
@article{arxiv.2408.03298,
title = {Packing independent cliques into planar graphs},
author = {Csaba Biró and Gabriel Collado and Oscar Zamora},
journal= {arXiv preprint arXiv:2408.03298},
year = {2025}
}