
doi: 10.5802/igt.17
arXiv: 2407.16882
We prove that for every positive integer d and forest F , the class of intersection graphs of axis-aligned boxes in ℝ d with no induced F subgraph is (polynomially) χ -bounded.
Mathematics - Combinatorics, Computer Science - Computational Geometry
Mathematics - Combinatorics, Computer Science - Computational Geometry
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
