Characterization of sparse monotone graph classes with bounded domination-to-2-independence ratio
Marthe Bonamy, Zden\v{e}k Dvo\v{r}\'ak, Lukas Michel, David Mik\v{s}an\'ik
TL;DR
This paper characterizes certain sparse monotone graph classes where the domination number is linearly bounded by the 2-independence number, providing insights into their structural properties.
Contribution
It offers an exact characterization of monotone graph classes with bounded average degree satisfying a domination-to-2-independence ratio condition.
Findings
Characterization of monotone graph classes with bounded average degree
Domination number is linearly bounded by 2-independence number in these classes
Provides structural insights into sparse monotone graphs
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Limits and Structures in Graph Theory