Information for "Babai (Graph Isomorphism, Bounded Number of Vertices of Each Color Graph Isomorphism Problem)"
Jump to navigation
Jump to search
View the protection log for this page.
Basic information
Display title | Babai (Graph Isomorphism, Bounded Number of Vertices of Each Color Graph Isomorphism Problem) |
Default sort key | Babai (Graph Isomorphism, Bounded Number of Vertices of Each Color Graph Isomorphism Problem) |
Page length (in bytes) | 364 |
Page ID | 40483 |
Page content language | en - English |
Page content model | wikitext |
Indexing by robots | Allowed |
Number of redirects to this page | 0 |
Page protection
Edit | Allow all users (infinite) |
Move | Allow all users (infinite) |
Edit history
Page creator | Admin (talk | contribs) |
Date of page creation | 12:16, 15 February 2023 |
Latest editor | Admin (talk | contribs) |
Date of latest edit | 08:57, 10 April 2023 |
Total number of edits | 2 |
Total number of distinct authors | 1 |
Recent number of edits (within past 90 days) | 0 |
Recent number of distinct authors | 0 |