There is currently no text in this page. You can search for this page title in other pages, or search the related logs, but you do not have permission to create this page.
The maximum degree-and-diameter-bounded subgraph problem
From Combinatorics Wiki