Characterization of sparse monotone graph classes with bounded domination-to-2-independence ratio
European Journal of Combinatorics · 2027-01 · 139 · 104459
DOI: 10.1016/j.ejc.2026.104459 ↗Kurz gefasst
Fachartikel in der Zeitschrift European Journal of Combinatorics, 2027-01. Verfasst von Marthe Bonamy und 3 weiteren Autor:innen. Die Arbeit nennt 19 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0). Gefördert von: ANR, Ministry of Education Youth and Sports of the Czech Republic.
Abstract (Originalsprache)
We give an exact characterization of monotone graph classes C with bounded average degree that satisfy the following property: The domination number of every graph from C is bounded by a linear function of its 2-independence number.
Förderung
- ANR
- Ministry of Education Youth and Sports of the Czech Republic
Zitieren
APA
Bonamy, M., Dvořák, Z., Michel, L., & Mikšaník, D. (2027). Characterization of sparse monotone graph classes with bounded domination-to-2-independence ratio. European Journal of Combinatorics, 139, 104459. https://doi.org/10.1016/j.ejc.2026.104459
Vancouver
Bonamy M, Dvořák Z, Michel L, Mikšaník D. Characterization of sparse monotone graph classes with bounded domination-to-2-independence ratio. European Journal of Combinatorics. 2027;139:104459. doi:10.1016/j.ejc.2026.104459
BibTeX
@article{Bonamy2027,
author = {Bonamy, Marthe and Dvořák, Zdeněk and Michel, Lukas and Mikšaník, David},
title = {Characterization of sparse monotone graph classes with bounded domination-to-2-independence ratio},
journal = {European Journal of Combinatorics},
year = {2027},
volume = {139},
pages = {104459},
doi = {10.1016/j.ejc.2026.104459}
}
EUVIMED