Pages that link to "Item:Q1692650"

The following pages link to Bounding the open \(k\)-monopoly number of strong product graphs (Q1692650):

Displaying 1 item.

• The complexity of open k-monopolies in graphs for negative k (Q5106671) (← links)