Treewidth versus clique number in graph classes with a forbidden structure

DOI10.1007/978-3-030-60440-0_8OpenAlexW3097846366MaRDI QIDQ2110610

Martin Milanič, Kenny Štorgel, Clément Dallard

Publication date: 21 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-60440-0_8

zbMATH Keywords

treewidthclique numbergraph class

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Fair allocation algorithms for indivisible items under structured conflict constraints, Treewidth versus clique number. II: Tree-independence number, On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs, Avoidable vertices and edges in graphs: existence, characterization, and applications