Pages that link to "Item:Q1003729"

The following pages link to Efficient algorithms for Roman domination on some classes of graphs (Q1003729):

Displaying 4 items.

• Computing Roman domatic number of graphs (Q284340) (← links)
• Roman domination in subgraphs of grids (Q324726) (← links)
• Roman domination on strongly chordal graphs (Q385486) (← links)
• Weak \(\{2\}\)-domination number of Cartesian products of cycles (Q1698059) (← links)