Maximum matching and kernelization of edge dominating set

Open Webpage

Hang Gao, Wenyu Gao

Published: 01 Jan 2018, Last Modified: 01 Oct 2024Inf. Process. Lett. 2018EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•A lower bound on the size of maximum matching for a special class of graph.•A linear kernel for the edge dominating set for graphs with maximum degree three.•Application of relationship between maximum matching and edge dominating set.