Information for "The Maximum Degree-and-Diameter-Bounded Subgraph Problem"

From Combinatorics Wiki

Basic information

Display titleThe Maximum Degree-and-Diameter-Bounded Subgraph Problem
Default sort keyThe Maximum Degree-and-Diameter-Bounded Subgraph Problem
Page length (in bytes)1,297
Page ID158
Page content languageen-gb - British English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)

Edit history

Page creatorCW>Hebert
Date of page creation20:03, 19 March 2012
Latest editorGrahame (talk | contribs)
Date of latest edit14:39, 3 January 2019
Total number of edits2
Total number of distinct authors2
Recent number of edits (within past 90 days)0
Recent number of distinct authors0
Retrieved from ‘http://combinatoricswiki.org/wiki/The_Maximum_Degree-and-Diameter-Bounded_Subgraph_Problem’