Revisiting $d$-distance (independent) domination in trees and in bipartite graphs

Documenti analoghi

• The $d$-distance $p$-packing domination number: complexity, cycles, and trees
  di: Bujtás, Csilla, et al.
  Pubblicazione: (2025)
• On $d$-distance $p$-packing domination number in strong products
  di: Bujtás, Csilla, et al.
  Pubblicazione: (2025)
• Maker-Breaker domination game on trees when Staller wins
  di: Bujtás, Csilla, et al.
  Pubblicazione: (2022)
• Independent mutual-visibility sets and distance edge-critical graphs
  di: Tian, Jing, et al.
  Pubblicazione: (2026)
• Total mutual-visibility in Hamming graphs
  di: Bujtás, Csilla, et al.
  Pubblicazione: (2023)