Full-Cover and Non-Overlapping Uni-domination in Graphs: Bounds and Complexity
cs.DM, math.CO
Submitted: 2026-11-16
Updated: 2026-11-16
Related papers
- Low-Temperature Sampling via Equilibrium Disagreements
- An Improved Bound for Testing k-Colorability
- Temporal Cliques Admit Linear Spanners
- Multiway Partition is FPT for Connectivity Functions
- Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
- Constrained intersection representations and forbidden patterns