The following pages link to On the existence of efficient and fair extensions of communication values for connected graphs (Q1668516):
Displaying 2 items.