Characterizing all $K_4$-free well-edge-dominated graphs of girth 3

Documenti analoghi

• Characterizing all nonbipartite well-edge-dominated graphs
  di: Anderson, Sarah E., et al.
  Pubblicazione: (2026)
• On Maker-Breaker domination game critical graphs
  di: Brešar, Boštjan, et al.
  Pubblicazione: (2025)
• An asymptotically tight upper bound for the domination number of the $2$-token graph of path graphs
  di: Troncoso, E. Acosta, et al.
  Pubblicazione: (2026)
• Grundy double domination number: bounds, graph operations, and efficient computation for $P_4$-tidy graphs
  di: Torres, Pablo
  Pubblicazione: (2025)
• On the domination number of the cartesian product of the path graph and any pair of graphs
  di: Tout, Omar
  Pubblicazione: (2023)