Coloring locally sparse graphs

J Anderson, A Dhawan, A Kuchukova - arXiv preprint arXiv:2402.19271, 2024 - arxiv.org
A graph $ G $ is $ k $-locally sparse if for each vertex $ v\in V (G) $, the subgraph induced
by its neighborhood contains at most $ k $ edges. Alon, Krivelevich, and Sudakov showed …
被引用次数：4 相关文章

Coloring locally sparse graphs

J Anderson, A Dhawan, A Kuchukova - arXiv e-prints, 2024 - ui.adsabs.harvard.edu
A graph $ G $ is $ k $-locally sparse if for each vertex $ v\in V (G) $, the subgraph induced
by its neighborhood contains at most $ k $ edges. Alon, Krivelevich, and Sudakov showed …