Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs

DOI10.1007/s10878-022-00982-8OpenAlexW4313639012MaRDI QIDQ2111523

Aifa Wang, Peng Li

Publication date: 17 January 2023

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-022-00982-8

zbMATH Keywords

polynomial time algorithminterval graphsvertex-edge dominationdouble vertex-edge domination\(k\)-vertex-edge domination

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

On \(k\)-vertex-edge domination of graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unified approach to domination problems on interval graphs
• Algorithmic graph theory and perfect graphs
• Results on vertex-edge and independent vertex-edge domination
• The longest cycle problem is polynomial on interval graphs
• Bounds on the vertex-edge domination number of a tree
• A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs
• Total vertex-edge domination
• Double vertex-edge domination
• Vertex-edge domination in graphs
• Vertex-edge domination in graphs
• Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs