Packing independent cliques into planar graphs

2024/08/06 by Csaba Bíró, Biró, Csaba, Gabriel Collado +3 · 1 citation
Computer Science · Engineering · #05C10 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Optimization and Packing Problems #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2408.03298

openalex publication_date 2024/08/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• Packing Independent Cliques in K₄-minor-free Graphs

Related

• Packing Independent Cliques in K₄-minor-free Graphs
• Graph Configurations and Independent Bondage Numbers of Planar Graphs
• Counting cliques in 1-planar graphs
• Tree decompositions with bounded independence number: beyond independent sets
• Treewidth versus clique number. II. Tree-independence number