Content deleted Content added
m Adding Good Article icon |
Citation bot (talk | contribs) Alter: url, volume, journal. URLs might have been anonymized. Add: hdl, isbn, s2cid, bibcode, doi, issue, volume. Formatted dashes. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_toolbar |
||
Line 68:
{{reflist|refs=
<ref name=3wells>{{citation|title=Puzzle|url=https://books.google.com/books?id=yLSTwH0pINIC&q=%22three+houses+and+three+wells%22
<ref name=ayres>{{citation
Line 140:
| publisher = Thomas Nelson
| title = Amusements in mathematics
| year = 1917| volume = 100 | issue = 2512 | doi = 10.1038/100302a0 | bibcode = 1917Natur.100..302. | s2cid = 10245524 }}. The solution given on [https://archive.org/details/amusementsinmath00dude/page/200 pp. 200–201] involves passing a line through one of the other houses.</ref>
<ref name=early>{{citation
Line 172:
| publisher = Springer | ___location = New York
| title = A Logical Approach to Discrete Math
| year = 1993| isbn = 978-1-4419-2835-1 | s2cid = 206657798 }}. See p. 437: "<math>K_{3,3}</math> is known as the ''utility graph''".</ref>
<ref name=harary>{{citation
Line 182:
| title = Recent results in topological graph theory
| volume = 15
| year = 1964| issue = 3–4 | hdl = 2027.42/41775 | s2cid = 123170864 }}; see p. 409.</ref>
<ref name=henneberg>{{citation
Line 190:
| pages = 345–434
| title = Encyklopädie der Mathematischen Wissenschaften
| volume = 4
| year = 1908| issue = 1
}}. See in particular [https://archive.org/stream/encyklomath104encyrich/#page/n425 p. 403].</ref> <ref name=intuitive>{{citation
Line 201 ⟶ 202:
| title = Some historical and intuitive aspects of graph theory
| volume = 2
| year = 1960| issue = 2 | bibcode = 1960SIAMR...2..123H }}</ref>
<ref name=kappraff>{{citation
Line 222 ⟶ 223:
| title = The utilities problem
| volume = 52
| year = 1979
}}</ref>
<ref name=kuratowski>{{citation
Line 232 ⟶ 234:
| url = http://matwbn.icm.edu.pl/ksiazki/fm/fm15/fm15126.pdf
| volume = 15
| year = 1930| doi = 10.4064/fm-15-1-271-283 }}</ref>
<ref name=larsen>{{citation
Line 302 ⟶ 304:
| title = Pseudo-triangulations, rigidity and motion planning<!-- Note: Journal website has incorrect title in metadata; do not change title to "Acute triangulations of polygons" -->
| volume = 34
| year = 2005| s2cid = 25281202 }}. See p. 600: "Not all generically minimally rigid graphs have embeddings as pseudo-triangulations, because not all are planar graphs. The smallest example {{nowrap|is <math>K_{3,3}</math>".}}</ref>
<ref name=thomsen>{{citation
Line 309 ⟶ 311:
| doi = 10.1002/cber.188601902285
| issue = 2
| journal = Berichte der
| pages = 2944–2950
| title = Die Constitution des Benzols
Line 333 ⟶ 335:
| title = A family of cubical graphs
| volume = 43
| year = 1947| issue = 4 | bibcode = 1947PCPS...43..459T }}</ref>
<ref name=wh07>{{citation
|