Pairwise compatibility graph: Revision history

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

curprev 20:4720:47, 1 September 2023‎ Citation bot talk contribs‎ 3,724 bytes +16‎ Add: volume, series. Removed parameters. | Use this bot. Report bugs. | Suggested by AManWithNoPlan | #UCB_toolbar undo

curprev 16:1016:10, 9 February 2023‎ Citation bot talk contribs‎ 3,708 bytes −148‎ Removed proxy/dead URL that duplicated identifier. Removed access-date with no URL. | Use this bot. Report bugs. | Suggested by Corvus florensis | #UCB_webform 94/3499 undo

curprev 02:3402:34, 30 January 2023‎ OAbot talk contribs‎ m 3,856 bytes +33‎ Open access bot: doi added to citation with #oabot. undo

curprev 13:0413:04, 3 January 2023‎ Citation bot talk contribs‎ 3,823 bytes +54‎ Add: doi, s2cid, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. Upgrade ISBN10 to 13. | Use this bot. Report bugs. | Suggested by SemperIocundus | #UCB_webform 665/2500 undo

curprev 03:2703:27, 30 December 2021‎ Caleb Stanford talk contribs‎ 2,094 bytes +531‎ Declining submission: dict - Submission is a dictionary definition and context - Submission provides insufficient context (AFCH 0.9.1) undo

curprev 22:5822:58, 29 December 2021‎ DanCherek talk contribs‎ 1,563 bytes −280‎ add required attribution for text copied from CC BY 4.0 article, combine refs undo
curprev 22:2322:23, 29 December 2021‎ SheikhAzizulHakim talk contribs‎ 1,843 bytes +143‎ Submitting using AfC-submit-wizard undo
curprev 22:2222:22, 29 December 2021‎ SheikhAzizulHakim talk contribs‎ 1,700 bytes +1,700‎ ←Created page with '{{subst:AfC submission/draftnew}} A graph <math>G</math> is a Pairwise Compatibility Graph (PCG) if there exists a tree <math>T</math> and two non-negative real numbers <math>d_{min} < d_{max}</math> such that each node <math>u'</math> of <math>G</math> has a one-to-one mapping with a leaf <math>u</math> of <math>T</math> such that two nodes <math>u'</math> and <math>v'</math> are...'