Two classes of edge domination in graphsBAOGEN XU.Discrete applied mathematics. 2006, Vol 154, Num 10, pp 1541-1546, issn 0166-218X, 6 p.Article

On the characterization of trees with signed edge domination numbers 1, 2, 3, or 4XIAOMING PI; HUANPING LIU.Discrete mathematics. 2009, Vol 309, Num 6, pp 1779-1782, issn 0012-365X, 4 p.Article

On edge domination numbers of graphsBAOGEN XU.Discrete mathematics. 2005, Vol 294, Num 3, pp 311-316, issn 0012-365X, 6 p.Article

A note on the signed edge domination number in graphsFU XUELIANG; YANG YUANSHENG; JIANG BAOQI et al.Discrete applied mathematics. 2008, Vol 156, Num 14, pp 2790-2792, issn 0166-218X, 3 p.Article

Edge domination on bipartite permutation graphs and cotriangulated graphsANAND SRINIVASAN; MADHUKAR, K; NAGAVAMSI, P et al.Information processing letters. 1995, Vol 56, Num 3, pp 165-171, issn 0020-0190Article

On the signed edge domination number of graphsAKBARI, S; BOLOUKI, S; HATAMI, P et al.Discrete mathematics. 2009, Vol 309, Num 3, pp 587-594, issn 0012-365X, 8 p.Conference Paper

INTRACTABILITY OF CLIQUE-WIDTH PARAMETERIZATIONSFOMIN, Fedor V; GOLOVACH, Petr A; LOKSHTANOV, Daniel et al.SIAM journal on computing (Print). 2010, Vol 39, Num 5, pp 1941-1956, issn 0097-5397, 16 p.Article

Perfect edge domination and efficient edge domination in graphsCHIN LUNG LU; KO, Ming-Tat; CHUAN YI TANG et al.Discrete applied mathematics. 2002, Vol 119, Num 3, pp 227-250, issn 0166-218XArticle

Approximating edge dominating set in dense graphsSCHMIED, Richard; VIEHMANN, Claus.Theoretical computer science. 2012, Vol 414, Num 1, pp 92-99, issn 0304-3975, 8 p.Article

On approximability of the independent/connected edge dominating set problemsFUJITO, Toshihiro.Information processing letters. 2001, Vol 79, Num 6, pp 261-266, issn 0020-0190Article

Linear Time Algorithms for Generalized Edge Dominating Set ProblemsBERGER, André; PAREKH, Ojas.Algorithmica. 2008, Vol 50, Num 2, pp 244-254, issn 0178-4617, 11 p.Conference Paper

Approximability of the capacitated b-edge dominating set problemBERGER, André; FUKUNAGA, Takuro; NAGAMOCHI, Hiroshi et al.Theoretical computer science. 2007, Vol 385, Num 1-3, pp 202-213, issn 0304-3975, 12 p.Article

Dominating Induced Matchings for P₇-Free Graphs in Linear TimeBRANDSTÄDT, Andreas; MOSCA, Raffaele.Algorithmica. 2014, Vol 68, Num 4, pp 998-1018, issn 0178-4617, 21 p.Article

Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3 : New Trends in Algorithms and Theory of ComputationMINGYU XIAO; NAGAMOCHI, Hiroshi.IEICE transactions on information and systems. 2013, Vol 96, Num 3, pp 408-418, issn 0916-8532, 11 p.Article

Results on the Grundy chromatic number of graphsZAKER, Manouchehr.Discrete mathematics. 2006, Vol 306, Num 23, pp 3166-3173, issn 0012-365X, 8 p.Conference Paper

On the complexity of the dominating induced matching problem in hereditary classes of graphsCARDOSO, Domingos M; KORPELAINEN, Nicholas; LOZIN, Vadim V et al.Discrete applied mathematics. 2011, Vol 159, Num 7, pp 521-531, issn 0166-218X, 11 p.Article

Improved approximation bounds for edge dominating set in dense graphsCARDINAL, Jean; LANGERMAN, Stefan; LEVY, Eythan et al.Theoretical computer science. 2009, Vol 410, Num 8-10, pp 949-957, issn 0304-3975, 9 p.Article

Approximation algorithms for partially covering with edgesPAREKH, Ojas.Theoretical computer science. 2008, Vol 400, Num 1-3, pp 159-168, issn 0304-3975, 10 p.Article

Approximation hardness of edge dominating set problemsCHLEBIK, Miroslav; CHLEBIKOVA, Janka.Journal of combinatorial optimization. 2006, Vol 11, Num 3, pp 279-290, issn 1382-6905, 12 p.Article

Edge-dominating cycles in graphsFUJITA, Shinya; SAITO, Akira; YAMASHITA, Tomoki et al.Discrete mathematics. 2007, Vol 307, Num 23, pp 2934-2942, issn 0012-365X, 9 p.Article

Path Hitting in Acyclic GraphsPAREKH, Ojas; SEGEV, Danny.Algorithmica. 2008, Vol 52, Num 4, pp 466-486, issn 0178-4617, 21 p.Article

Exact Algorithms for Edge DominationROOIJ, Johan M. M. Van; BODLAENDER, Hans L.Algorithmica. 2012, Vol 64, Num 4, pp 535-563, issn 0178-4617, 29 p.Article

Lower Bounds for Local ApproximationGOOS, Mika; HIRVONEN, Juho; SUOMELA, Jukka et al.Journal of the Association for Computing Machinery. 2013, Vol 60, Num 5, issn 0004-5411, 39.1-39.23Article