Pages that link to "Item:Q1377616"
From MaRDI portal
The following pages link to Distance-related invariants on polygraphs (Q1377616):
Displayed 3 items.
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039) (← links)
- The obnoxious center problem on weighted cactus graphs. (Q1427192) (← links)
- \(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815) (← links)