Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
type: Item
instance of: scholarly article
title: Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
author: Peng Li
author: Aifa Wang
published in: Journal of Combinatorial Optimization
publication date: 2023-01-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7642701
zbMATH Keywords: vertex-edge domination
zbMATH Keywords: double vertex-edge domination
zbMATH Keywords: \(k\)-vertex-edge domination
zbMATH Keywords: polynomial time algorithm
zbMATH Keywords: interval graphs
MaRDI profile type: Publication
full work available at URL: s10878-022-00982-8
OpenAlex ID: W4313639012
cites work: Vertex-edge domination in graphs
cites work: Total vertex-edge domination
cites work: Q3344239
cites work: Algorithmic graph theory and perfect graphs
cites work: Q4368729
cites work: Q4368728
cites work: Bounds on the vertex-edge domination number of a tree
cites work: Double vertex-edge domination
cites work: Q3059032
cites work: Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
cites work: Spanning connectedness and Hamiltonian thickness of graphs and interval graphs
cites work: A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs
cites work: Q3686754
cites work: Results on vertex-edge and independent vertex-edge domination
cites work: A unified approach to domination problems on interval graphs
cites work: Q3783331
cites work: The longest cycle problem is polynomial on interval graphs
cites work: Q4352951
DOI: 10.1007/S10878-022-00982-8
description: scientific article; zbMATH DE number 7642701