Information for "The Degree Diameter Problem for Bipartite Graphs"
From Combinatorics Wiki
Basic information
Display title | The Degree Diameter Problem for Bipartite Graphs |
Default sort key | The Degree Diameter Problem for Bipartite Graphs |
Page length (in bytes) | 25,537 |
Page ID | 148 |
Page content language | en-gb - British English |
Page content model | wikitext |
Indexing by robots | Allowed |
Number of redirects to this page | 0 |
Counted as a content page | Yes |
Page protection
Edit | Allow all users (infinite) |
Move | Allow all users (infinite) |
Edit history
Page creator | CW>Gpineda |
Date of page creation | 04:22, 17 January 2012 |
Latest editor | Guillermo (talk | contribs) |
Date of latest edit | 05:55, 18 February 2022 |
Total number of edits | 4 |
Total number of distinct authors | 3 |
Recent number of edits (within past 90 days) | 0 |
Recent number of distinct authors | 0 |