scientific article; zbMATH DE number 7693181

DOI10.22049/cco.2021.27163.1206zbMath1524.05218MaRDI QIDQ6155858

No author found.

Publication date: 7 June 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-completenessinteger linear programmingvertex covergraph classesvertex-edge Roman-domination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Linear programming (90C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmic aspects of \(b\)-disjunctive domination in graphs
• Counting independent sets in tree convex bipartite graphs
• Roman domination in graphs.
• Algorithmic aspects of semitotal domination in graphs
• Threshold graphs and related topics
• On vertex-edge and independent vertex-edge domination
• Vertex-edge domination in cubic graphs
• Total Roman reinforcement in graphs
• Bounds on the vertex-edge domination number of a tree
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Triple Roman domination in graphs
• Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
• Graph Classes: A Survey
• Vertex-Edge Roman Domination
• Node-and edge-deletion NP-complete problems
• Algorithms and Computation
• On maximal Roman domination in graphs
• Vertex-edge domination in graphs

This page was built for publication: