| Display title | Graph factorization |
| Default sort key | Graph factorization |
| Page length (in bytes) | 11,632 |
| Namespace ID | 0 |
| Page ID | 3298854 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 36 |
| Number of page watchers who visited in the last 30 days | 2 |
| Number of redirects to this page | 11 |
| Counted as a content page | Yes |
| Wikidata item ID | Q5597083 |
| Central description | partition of the edges of a graph into disjoint spanning k-regular subgraphs |
| Page image |  |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | RobertBorgersen (talk | contribs) |
| Date of page creation | 05:54, 2 December 2005 |
| Latest editor | Beland (talk | contribs) |
| Date of latest edit | 20:29, 18 May 2025 |
| Total number of edits | 101 |
| Recent number of edits (within past 30 days) | 1 |
| Recent number of distinct authors | 1 |
| Hidden category (1) | This page is a member of 1 hidden category (help):
|
| Transcluded templates (43) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
