Pages that link to "Item:Q5897548"

The following pages link to Graph-Theoretic Concepts in Computer Science (Q5897548):

Displaying 5 items.

• Upper bounds on Roman domination numbers of graphs (Q764908) (← links)
• Improved integer linear programming formulation for weak Roman domination problem (Q1626222) (← links)
• Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821) (← links)
• Approximation algorithm for a generalized Roman domination problem in unit ball graphs (Q2292134) (← links)
• The Roman domination number of some special classes of graphs - convex polytopes (Q3390794) (← links)