Revision as of 18:14, 10 June 2020 edit A3nm (talk \| contribs) Extended confirmed users, Pending changes reviewers 4,580 edits →Orientable graphs: clarify that this is not an open ear decomposition Tag: 2017 wikitext editor ← Previous edit		Revision as of 13:35, 7 September 2020 edit undo Citation bot (talk \| contribs) Bots 5,870,168 edits Add: s2cid, url. \| You can use this bot yourself. Report bugs here. \| Suggested by SemperIocundus \| via #UCB_webform Next edit →
Line 32: \| title = Parallel strong orientation of an undirected graph \| volume = 18 \| year = 1984\| url = https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1361&context=cstech }}. ~~\| year = 1984}}.~~ {{citation \| last = Balakrishnan \| first = V. K. Line 91: \| title = Algorithm 447: efficient algorithms for graph manipulation \| volume = 16 \| year = 1973\| s2cid = 14772567 }}. {{citation \| last = Robbins \| first = H. E. \| author-link = Herbert Robbins

Robbins' theorem: Difference between revisions