Related changes
Enter a page name to see changes on pages linked to or from that page. (To see members of a category, enter Category:Name of category). Changes to pages on your Watchlist are shown in bold with a green bullet. See more at Help:Related changes.
List of abbreviations (help):
- D
- Edit made at Wikidata
- r
- Edit flagged by ORES
- N
- New page
- m
- Minor edit
- b
- Bot edit
- (±123)
- Page byte size change
- Temporarily watched page
15 July 2025
- diffhist Enneahedron 02:39 −1 Dedhert.Jr talk contribs (→Examples: ce)
- diffhist Enneahedron 02:38 +1,826 Dedhert.Jr talk contribs (source J51's dual)
- diffhist Enneahedron 02:30 +991 Dedhert.Jr talk contribs (source constructions)
- diffhist Enneahedron 02:30 −222 David Eppstein talk contribs (→Examples: tighter)
- diffhist Enneahedron 02:20 −674 Dedhert.Jr talk contribs (mentioned in the galleries)
- diffhist Enneahedron 02:19 +25 Dedhert.Jr talk contribs (fix refs)
- diffhist Enneahedron 02:16 +115 Dedhert.Jr talk contribs (→Examples: gallery)
11 July 2025
- diffhist Colin de Verdière graph invariant 23:19 −88 Kevin Lamoreau talk contribs (→Characterization of known graph families: I'm not not sure that parenthetical statement is correct; in any case, a single vertex graph might be assumed to not have any loops anyway, so that caveat wouldn't matter)
- diffhist Colin de Verdière graph invariant 23:10 +8 Kevin Lamoreau talk contribs (→Graph minors: making the subscripts of K sub 2 non-italicized)
- diffhist Colin de Verdière graph invariant 23:08 0 Kevin Lamoreau talk contribs (→Graph minors: fixing an error on my last edit (I had copied and pasted and forgotten to change the 'n's to '2's)
- diffhist Colin de Verdière graph invariant 23:06 +265 Kevin Lamoreau talk contribs (→Graph minors: note about how the sole forbidden for a CdV invariant of ≤ 0 (< 1) is {{mvar|{{overline|K}}{{sub|n}}}} rather than {{mvar|K{{sub|n}}}} if it is not assumed that all graphs are connected, as it was in Colin de Verdière's paper)
- diffhist Colin de Verdière graph invariant 22:48 +261 Kevin Lamoreau talk contribs (→Characterization of known graph families: it seems pretty clear from the van der Holst et al paper that K sub 0 would have a CdV invariant of 0 − 1 = −1, and Colin de Verdière's original paper calls K sub 1 a 0-critical graph (he also said K sub 2 was 1-critical, but he wasn't counting non-connected graphs like the compliment of K sub 2); a loop would mean a one-vertex graph is not a linear forest, so the CdV invariant would be ≥ 2)
- diffhist Module:Footnotes/whitelist 03:39 +138 Hike395 talk contribs (add per Talk)