Perfect edge domination: hard and solvable cases

Let G be an undirected graph. An edge of Gdominates itself and all edges adjacent to it. A subset E′ of edges of G is an edge dominating set of G, if every edge of the graph is dominated by some edge of E′. We say that E′ is a perfect edge dominating set of G, if every edge not in E′ is dominated by...

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado: 2018
Materias:
Claw-free graphs
Complexity dichotomy
Cubic graphs
NP-completeness
Perfect edge domination
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_02545330_v264_n1-2_p287_Lin
http://hdl.handle.net/20.500.12110/paper_02545330_v264_n1-2_p287_Lin
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares