Packing independent cliques into planar graphs

Authors

Csaba Biró, Department of Mathematics, University of Louisville, Louisville, KY 40292, USA; and Centro de Investigación en Matemática Pura y Aplicada, Universidad de Costa Rica, San José, Costa RicaFollow
Gabriel Collado, Universidad de Costa Rica, San José, Costa Rica; current address: Department of Mathematics, Statistics, and Computer Science, University of Illinois Chicago, Chicago, IL 60607, USAFollow
Oscar Zamora, Centro de Investigación en Matemática Pura y Aplicada, Universidad de Costa Rica, San José, Costa RicaFollow

Publication Date

September 2025

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 $2$.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.

Recommended Citation

Biró, Csaba; Collado, Gabriel; and Zamora, Oscar (2025) "Packing independent cliques into planar graphs," Theory and Applications of Graphs: Vol. 12: Iss. 2, Article 3.
DOI: 10.20429/tag.2025.120203
Available at: https://digitalcommons.georgiasouthern.edu/tag/vol12/iss2/3