Domination versus edge domination

DOI10.1016/j.dam.2020.05.030zbMath1466.05155arXiv1906.10420OpenAlexW3036674379MaRDI QIDQ2197443

Dieter Rautenbach, Elena Mohr, Julien Baste, Michael A. Henning, Maximilian Fürst

Publication date: 31 August 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.10420

zbMATH Keywords

dominationedge dominationminimum maximal matching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (4)

Conjecture of TxGraffiti: Independence, domination, and matchings ⋮ Domination versus edge domination on claw-free graphs ⋮ Towards the conjecture on domination versus edge domination in graphs ⋮ Majority bad number

Cites Work

• On domination and independent domination numbers of a graph
• Approximating edge dominating set in dense graphs
• Integer programming formulations for the minimum weighted maximal matching problem
• Approximation hardness of edge dominating set problems
• Minimum Edge Dominating Sets
• A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem
• Edge Dominating Sets in Graphs
• A \(2\frac{1}{10}\)-approximation algorithm for a generalization of the weighted edge-dominating set problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Domination versus edge domination