View source for Three utilities problem

{{good article}}
{{short description|Mathematical puzzle of avoiding crossings}}
{{redirect|Water, gas and electricity|the utilities|Public utility|the novel Sewer, Gas & Electric|Matt Ruff}}
[[File:3 utilities problem plane.svg|thumb|Diagram of the three utilities problem on a plane. All lines are connected, but two of them are crossing.]]
{{multiple image
|image1=Graph K3-3.svg
|image2=Complex polygon 2-4-3-bipartite graph.png
|total_width=360
|footer=Two views of the utility graph, also known as the Thomsen graph or <math>K_{3,3}</math>}}
The '''three utilities problem''', also known as '''water, gas and electricity''', is a [[mathematical puzzle]] that asks for non-crossing connections to be drawn between three houses and three utility companies on a [[Plane (geometry)|plane]]. When posing it in the early 20th century, [[Henry Dudeney]] wrote that it was already an old problem. It is an [[List of impossible puzzles|impossible puzzle]]: it is not possible to connect all nine lines without any of them crossing. Versions of the problem on nonplanar surfaces such as a [[torus]] or [[Möbius strip]], or that allow connections to pass through other houses or utilities, can be solved.

This puzzle can be formalized as a problem in [[topological graph theory]] by asking whether the [[complete bipartite graph]] <math>K_{3,3}</math>, with vertices representing the houses and utilities and edges representing their connections, has a [[graph embedding]] in the plane. The impossibility of the puzzle corresponds to the fact that <math>K_{3,3}</math> is not a [[planar graph]]. Multiple proofs of this impossibility are known, and form part of the proof of [[Kuratowski's theorem]] characterizing planar graphs by two forbidden subgraphs, one of which {{nowrap|is <math>K_{3,3}</math>.}} The question of minimizing the [[Crossing number (graph theory)|number of crossings]] in drawings of complete bipartite graphs is known as [[Turán's brick factory problem]], and for <math>K_{3,3}</math> the minimum number of crossings is one.

<math>K_{3,3}</math> is a graph with six vertices and nine edges, often referred to as the '''utility graph''' in reference to the problem.{{r|gs93}} It has also been called the '''Thomsen graph''' after 19th-century chemist [[Hans Peter Jørgen Julius Thomsen|Julius Thomsen]]. It is a [[well-covered graph]], the smallest [[triangle-free graph|triangle-free]] [[cubic graph]], and the smallest non-planar [[Laman graph|minimally rigid graph]].
==History==
A review of the history of the three utilities problem is given by {{harvtxt|Kullman|1979}}. He states that most published references to the problem characterize it as "very ancient".{{r|kullman1979}} In the earliest publication found by Kullman, {{harvs|first=Henry|last=Dudeney|authorlink=Henry Dudeney|year=1917|txt}} names it "water, gas, and electricity". However, Dudeney states that the problem is "as old as the hills...much older than [[electric lighting]], or even [[town gas|gas]]".{{r|dud17}} Dudeney also published the same puzzle previously, in ''[[The Strand Magazine]]'' in 1913.{{r|dud13}} A competing claim of priority goes to [[Sam Loyd]], who was quoted by his son in a posthumous biography as having published the problem in 1900.{{r|early}}

Another early version of the problem involves connecting three houses to three wells.{{r|3wells}} It is stated similarly to a different (and solvable) puzzle that also involves three houses and three fountains, with all three fountains and one house touching a rectangular wall; the puzzle again involves making non-crossing connections, but only between three designated pairs of houses and wells or fountains, as in modern [[numberlink]] puzzles.{{r|fountains}} Loyd's puzzle "The Quarrelsome Neighbors" similarly involves connecting three houses to three gates by three non-crossing paths (rather than nine as in the utilities problem); one house and the three gates are on the wall of a rectangular yard, which contains the other two houses within it.{{r|quarrelsome}}

As well as in the three utilities problem, the graph <math>K_{3,3}</math> appears in late 19th-century and early 20th-century publications both in early studies of [[structural rigidity]]{{r|dixon|henneberg}} and in [[chemical graph theory]], where [[Hans Peter Jørgen Julius Thomsen|Julius Thomsen]] proposed it in 1886 for the then-uncertain structure of [[benzene]].{{r|thomsen}} In honor of Thomsen's work, <math>K_{3,3}</math> is sometimes called the Thomsen graph.{{r|bollobas}}

==Statement==
The three utilities problem can be stated as follows:

{{quotation|Suppose three houses each need to be connected to the water, gas, and electricity companies, with a separate line from each house to each company. Is there a way to make all nine connections without any of the lines crossing each other?}}

The problem is an abstract mathematical puzzle which imposes constraints that would not exist in a practical engineering situation. Its mathematical formalization is part of the field of [[topological graph theory]] which studies the [[embedding]] of [[Graph (discrete mathematics)|graph]]s on [[surface (topology)|surface]]s. An important part of the puzzle, but one that is often not stated explicitly in informal wordings of the puzzle, is that the houses, companies, and lines must all be placed on a two-dimensional surface with the topology of a [[Plane (geometry)|plane]], and that the lines are not allowed to pass through other buildings; sometimes this is enforced by showing a drawing of the houses and companies, and asking for the connections to be drawn as lines on the same drawing.{{r|intuitive|bona}}

In more formal [[graph theory|graph-theoretic]] terms, the problem asks whether the [[complete bipartite graph]] <math>K_{3,3}</math> is a [[planar graph]]. This graph has six vertices in two subsets of three: one vertex for each house, and one for each utility. It has nine edges, one edge for each of the pairings of a house with a utility, or more abstractly one edge for each pair of a vertex in one subset and a vertex in the other subset. Planar graphs are the graphs that can be drawn without crossings in the plane, and if such a drawing could be found, it would solve the three utilities puzzle.{{r|intuitive|bona}}

==Puzzle solutions==
===Unsolvability===
[[File:3_utilities_problem_proof.svg|thumb|[[Proof without words]]: One house is temporarily deleted. The lines connecting the remaining houses with the utilities divide the plane into three regions. Whichever region the deleted house is placed into, the similarly shaded utility is outside the region. By the [[Jordan curve theorem]], a line connecting them must intersect one of the existing lines.]]
As it is usually presented (on a flat two-dimensional plane), the solution to the utility puzzle is "no": there is no way to make all nine connections without any of the lines crossing each other.
In other words, the graph <math>K_{3,3}</math> is not planar. [[Kazimierz Kuratowski]] stated in 1930 that <math>K_{3,3}</math> is nonplanar,{{r|kuratowski}} from which it follows that the problem has no solution.  {{harvtxt|Kullman|1979}}, however, states that "Interestingly enough, Kuratowski did not publish a detailed proof that [ <math>K_{3,3}</math> ] is non-planar".{{r|kullman1979}}

One proof of the impossibility of finding a planar embedding of <math>K_{3,3}</math> uses a case analysis involving the [[Jordan curve theorem]].{{r|ayres}} In this solution, one examines different possibilities for the locations of the vertices with respect to the 4-cycles of the graph and shows that they are all inconsistent with a planar embedding.{{r|trudeau}}

Alternatively, it is possible to show that any [[bridgeless graph|bridgeless]] [[bipartite graph|bipartite]] planar graph with <math>V</math> vertices and <math>E</math> edges has <math>E\le 2V-4</math> by combining the [[Euler characteristic|Euler formula]] <math>V-E+F=2</math> (where <math>F</math> is the number of faces of a planar embedding) with the observation that the number of faces is at most half the number of edges (the vertices around each face must alternate between houses and utilities, so each face has at least four edges, and each edge belongs to exactly two faces). In the utility graph, <math>E=9</math> and <math>2V-4=8</math> so in the utility graph it is untrue that <math>E\le 2V-4</math>. Because it does not satisfy this inequality, the utility graph cannot be planar.{{r|kappraff}}{{Clear|left}}

===Changing the rules===
{{multiple image|total_width=480
|image1=3 utilities problem moebius.svg|caption1=Solution on a Möbius strip
|image2=3_utilities_problem_torus.svg|caption2=Solution on a torus
|image3=4_utilities_problem_torus.svg|caption3=A torus allows up to 4 utilities and 4 houses
}}
<math>K_{3,3}</math> is a [[toroidal graph]], which means that it can be embedded without crossings on a [[torus]], a surface of genus one.{{r|harary}} These embeddings solve versions of the puzzle in which the houses and companies are drawn on a [[coffee mug]] or other such surface instead of a flat plane.{{r|parker}} There is even enough additional freedom on the torus to solve a version of the puzzle with four houses and four utilities.{{r|obeirne|early}} Similarly, if the three utilities puzzle is presented on a sheet of a transparent material, it may be solved after twisting and gluing the sheet to form a [[Möbius strip]].{{r|larsen}}

Another way of changing the rules of the puzzle that would make it solvable, suggested by [[Henry Dudeney]], is to allow utility lines to pass through other houses or utilities than the ones they connect.{{r|dud17}}

==Properties of the utility graph==
Beyond the utility puzzle, the same graph <math>K_{3,3}</math> comes up in several other mathematical contexts, including [[Structural rigidity|rigidity theory]], the classification of [[Cage (graph theory)|cages]] and [[well-covered graph]]s, the study of [[crossing number (graph theory)|graph crossing numbers]], and the theory of [[graph minor]]s.

===Rigidity===
The utility graph <math>K_{3,3}</math> is a [[Laman graph]], meaning that for [[almost all]] placements of its vertices in the plane, there is no way to continuously move its vertices while preserving all edge lengths, other than by a [[Rigid transformation|rigid motion]] of the whole plane, and that none of its [[spanning subgraph]]s have the same [[rigid system|rigidity]] property. It is the smallest example of a nonplanar Laman graph.{{r|streinu}} Despite being a minimally rigid graph, it has non-rigid embeddings with special placements for its vertices.{{r|dixon|wh07}} For general-position embeddings, a [[polynomial equation]] describing all possible placements with the same edge lengths has degree 16, meaning that in general there can be at most 16 placements with the same lengths. It is possible to find systems of edge lengths for which up to eight of the solutions to this equation describe realizable placements.{{r|wh07}}

===Other graph-theoretic properties===
<math>K_{3,3}</math> is a [[triangle-free graph]], in which every vertex has exactly three neighbors (a [[cubic graph]]). Among all such graphs, it is the smallest. Therefore, it is the [[Cage (graph theory)|(3,4)-cage]], the smallest graph that has three neighbors per vertex and in which the shortest cycle has length four.{{r|tutte}}

Like all other [[complete bipartite graph]]s, it is a [[well-covered graph]], meaning that every [[maximal independent set]] has the same size. In this graph, the only two maximal independent sets are the two sides of the bipartition, and are of equal sizes. <math>K_{3,3}</math> is one of only seven [[cubic graph|3-regular]] [[k-vertex-connected graph|3-connected]] well-covered graphs.{{r|cer93}}

===Generalizations===
[[File:K33 one crossing.svg|thumb|upright=0.5|Drawing of <math>K_{3,3}</math> with one crossing]]
Two important characterizations of planar graphs, [[Kuratowski's theorem]] that the planar graphs are exactly the graphs that contain neither <math>K_{3,3}</math> nor the [[complete graph]] <math>K_5</math> as a subdivision, and [[Wagner's theorem]] that the planar graphs are exactly the graphs that contain neither <math>K_{3,3}</math> nor <math>K_5</math> as a [[minor (graph theory)|minor]], make use of and generalize the non-planarity of <math>K_{3,3}</math>.{{r|little}}

[[Pál Turán]]'s "[[Turán's brick factory problem|brick factory problem]]" asks more generally for a formula for the [[crossing number (graph theory)|minimum number of crossings]] in a drawing of the [[complete bipartite graph]] <math>K_{a,b}</math> in terms of the numbers of vertices <math>a</math> and <math>b</math> on the two sides of the bipartition. The utility graph <math>K_{3,3}</math> may be drawn with only one crossing, but not with zero crossings, so its crossing number is one.{{r|early|ps09}}{{Clear|left}}

==References==
{{reflist|refs=

<ref name=3wells>{{citation|title=Puzzle|url=https://books.google.com/books?id=yLSTwH0pINIC&q=%22three+houses+and+three+wells%22|magazine=Successful Farming|year=1914|volume=13|page=50}}; {{citation|url=https://books.google.com/books?id=w8tPAQAAMAAJ&pg=PA392|year=1916|magazine=The Youth's Companion|page=392|volume=90|issue=2|title=A well and house puzzle}}.</ref>

<ref name=ayres>{{citation
 | last = Ayres | first = W. L.
 | doi = 10.1080/00029890.1938.11990773
 | issue = 2
 | journal = [[The American Mathematical Monthly]]
 | jstor = 2304276
 | mr = 1524194
 | pages = 88–92
 | title = Some elementary aspects of topology
 | volume = 45
 | year = 1938}}</ref>

<ref name=bollobas>{{citation
 | last = Bollobás | first = Béla | author-link = Béla Bollobás
 | doi = 10.1007/978-1-4612-0619-4
 | isbn = 0-387-98488-7
 | mr = 1633290
 | page = 23
 | publisher = Springer-Verlag, New York
 | series = Graduate Texts in Mathematics
 | title = Modern Graph Theory
 | url = https://books.google.com/books?id=JeIlBQAAQBAJ&pg=PA23
 | volume = 184
 | year = 1998}}</ref>

<ref name=bona>{{citation
 | last = Bóna | first = Miklós | author-link = Miklós Bóna
 | isbn = 9789814335232
 | pages = 275–277
 | publisher = World Scientific
 | title = A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory
 | year = 2011}}. Bóna introduces the puzzle (in the form of three houses to be connected to three wells) on p.&nbsp;275, and writes on p.&nbsp;277 that it "is equivalent to the problem of drawing <math>K_{3,3}</math> on a plane surface without crossings".</ref>

<ref name=cer93>{{citation
 | last1 = Campbell | first1 = S. R.
 | last2 = Ellingham | first2 = M. N. | author2-link = Mark Ellingham
 | last3 = Royle | first3 = Gordon F. | author3-link = Gordon Royle
 | journal = Journal of Combinatorial Mathematics and Combinatorial Computing
 | mr = 1220613
 | pages = 193–212
 | title = A characterisation of well-covered cubic graphs
 | volume = 13
 | year = 1993}}</ref>

<ref name=dixon>{{citation
 | last = Dixon | first = A. C. | author-link = Alfred Cardew Dixon
 | jfm = 30.0622.02
 | journal = [[Messenger of Mathematics]]
 | pages = 1–21
 | title = On certain deformable frameworks
 | url = https://gdz.sub.uni-goettingen.de/id/PPN599484047_0029?tify=%7B%22pages%22%3A%5B5%5D%7D
 | volume = 29
 | year = 1899}}</ref>

<ref name=dud13>{{citation
 | last = Dudeney | first = Henry | author-link = Henry Dudeney
 | magazine = [[The Strand Magazine]]
 | page = 110
 | title = Perplexities, with some easy puzzles for beginners
 | url = https://archive.org/stream/TheStrandMagazineAnIllustratedMonthly/TheStrandMagazine1913bVol.XlviJul-dec#page/n119/mode/2up
 | volume = 46
 | year = 1913}}</ref>

<ref name=dud17>{{citation
 | last = Dudeney | first = Henry | author-link = Henry Dudeney
 | contribution = Problem 251 – Water, Gas, and Electricity
 | contribution-url = https://archive.org/stream/amusementsinmath00dude#page/72
 | page = 73
 | 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
 | last1 = Beineke | first1 = Lowell | author1-link = L. W. Beineke
 | last2 = Wilson | first2 = Robin | author2-link = Robin Wilson (mathematician)
 | doi = 10.1007/s00283-009-9120-4
 | issue = 2
 | journal = [[The Mathematical Intelligencer]]
 | mr = 2657999
 | pages = 41–48
 | s2cid = 122588849
 | title = The early history of the brick factory problem
 | volume = 32
 | year = 2010}}</ref>

<ref name=fountains>{{citation
 | contribution = 32. The fountain puzzle
 | contribution-url = https://books.google.com/books?id=kbI_AQAAMAAJ&pg=PA276
 | location = New York
 | page = 276
 | publisher = Dick & Fitzgerald
 | title = The Magician's Own Book, Or, The Whole Art of Conjuring
 | year = 1857}}</ref>

<ref name=gs93>{{citation
 | last1 = Gries | first1 = David | author1-link = David Gries
 | last2 = Schneider | first2 = Fred B. | author2-link = Fred B. Schneider
 | contribution = Chapter 19: A theory of graphs
 | doi = 10.1007/978-1-4757-3837-7
 | pages = 423–460
 | 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
 | last = Harary | first = F. | author-link = Frank Harary
 | doi = 10.1007/BF01897149
 | journal = Acta Mathematica
 | mr = 166775
 | pages = 405–411
 | title = Recent results in topological graph theory
 | volume = 15
 | year = 1964| issue = 3–4 | hdl = 2027.42/41775 | s2cid = 123170864 | hdl-access = free
 }}; see p. 409.</ref>

<ref name=henneberg>{{citation
 | last = Henneberg | first = L.
 | contribution = Die graphische Statik der starren Körper
 | contribution-url = https://archive.org/details/encyklomath104encyrich/page/n367
 | 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.&nbsp;403].</ref>

<ref name=intuitive>{{citation
 | last = Harary | first = Frank | author-link = Frank Harary
 | doi = 10.1137/1002023
 | journal = [[SIAM Review]]
 | mr = 111698
 | pages = 123–131
 | title = Some historical and intuitive aspects of graph theory
 | volume = 2
 | year = 1960| issue = 2 | bibcode = 1960SIAMR...2..123H }}</ref>

<ref name=kappraff>{{citation
 | last = Kappraff | first = Jay | author-link = Jay Kappraff
 | isbn = 9789810245863
 | page = 128
 | publisher = World Scientific
 | series = K & E Series on Knots and Everything
 | title = Connections: The Geometric Bridge Between Art and Science
 | url = https://books.google.com/books?id=twF7pOYXSTcC&pg=PA128
 | volume = 25
 | year = 2001}}</ref>

<ref name=kullman1979>{{citation
 | last = Kullman | first = David
 | issue = 5
 | journal = [[Mathematics Magazine]]
 | jstor = 2689782
 | pages = 299–302
 | title = The utilities problem
 | volume = 52
 | year = 1979| doi = 10.1080/0025570X.1979.11976807
 }}</ref>

<ref name=kuratowski>{{citation
 | last = Kuratowski | first = Kazimierz | author-link = Kazimierz Kuratowski
 | journal = Fundamenta Mathematicae
 | language = fr
 | pages = 271–283
 | title = Sur le problème des courbes gauches en topologie
 | url = http://matwbn.icm.edu.pl/ksiazki/fm/fm15/fm15126.pdf
 | volume = 15
 | year = 1930
 | doi = 10.4064/fm-15-1-271-283|doi-access=free }}</ref>

<ref name=larsen>{{citation
 | last = Larsen | first = Mogens Esrom
 | editor1-last = Guy | editor1-first = Richard K. | editor1-link = Richard K. Guy
 | editor2-last = Woodrow | editor2-first = Robert E.
 | contribution = Misunderstanding my mazy mazes may make me miserable
 | isbn = 0-88385-516-X
 | mr = 1303141
 | pages = 289–293
 | publisher = Mathematical Association of America | location = Washington, DC
 | series = MAA Spectrum
 | title = Proceedings of the Eugène Strens Memorial Conference on Recreational Mathematics and its History held at the University of Calgary, Calgary, Alberta, August 1986
 | year = 1994}}. See [https://books.google.com/books?id=FsH2DwAAQBAJ&pg=PA292 Figure 7, p. 292].</ref>

<ref name=little>{{citation
 | last = Little | first = Charles H. C.
 | editor1-last = Casse | editor1-first = Louis R. A.
 | editor2-last = Wallis | editor2-first = Walter D.
 | contribution = A theorem on planar graphs
 | doi = 10.1007/BFb0097375
 | mr = 0427121
 | pages = 136–141
 | publisher = Springer
 | series = Lecture Notes in Mathematics
 | title = Combinatorial Mathematics IV: Proceedings of the Fourth Australian Conference Held at the University of Adelaide August 27–29, 1975
 | volume = 560
 | isbn = 978-3-540-08053-4
 | year = 1976}}</ref>

<ref name=obeirne>{{citation
 | last = O’Beirne | first = T. H.
 | date = December 21, 1961
 | issue = 266
 | magazine = [[New Scientist]]
 | pages = 751–753
 | title = Christmas puzzles and paradoxes, 51: For boys, men and heroes
 | url = https://books.google.com/books?id=rykw9gx81GoC&pg=PA751
 | volume = 12}}</ref>

<ref name=parker>{{citation
 | last = Parker | first = Matt | author-link = Matt Parker
 | isbn = 978-0-374-53563-6
 | mr = 3753642
 | pages = 180–181, 191–192
 | publisher = Farrar, Straus and Giroux | location = New York
 | title = Things to Make and Do in the Fourth Dimension: A Mathematician's Journey Through Narcissistic Numbers, Optimal Dating Algorithms, at Least Two Kinds of Infinity, and More
 | year = 2015}}</ref>

<ref name=ps09>{{citation
 | last1 = Pach | first1 = János | author1-link = János Pach
 | last2 = Sharir | first2 = Micha | author2-link = Micha Sharir
 | contribution = 5.1 Crossings—the Brick Factory Problem
 | pages = 126–127
 | publisher = [[American Mathematical Society]]
 | series = Mathematical Surveys and Monographs
 | title = Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures
 | volume = 152
 | year = 2009}}</ref>

<ref name=quarrelsome>{{citation|title=Mathematical Puzzles of Sam Loyd|first=Sam|last=Loyd|author-link=Sam Loyd|editor-first=Martin|editor-last=Gardner|editor-link=Martin Gardner|publisher=Dover Books|year=1959|isbn=((9780486204987))<!-- isbn ok, for later printing of same edition by same publisher -->|contribution=82: The Quarrelsome Neighbors|page=79|contribution-url=https://books.google.com/books?id=QCy6DzgqcI4C&pg=PA79}}</ref>

<ref name=streinu>{{citation
 | last = Streinu | first = Ileana | author-link = Ileana Streinu
 | doi = 10.1007/s00454-005-1184-0 | doi-access=free
 | issue = 4
 | journal = [[Discrete & Computational Geometry]]
 | mr = 2173930
 | pages = 587–635
 | 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
 | last = Thomsen | first = Julius | author-link = Hans Peter Jørgen Julius Thomsen
 | date = July 1886
 | doi = 10.1002/cber.188601902285
 | issue = 2
 | journal = Berichte der Deutschen Chemischen Gesellschaft
 | pages = 2944–2950
 | title = Die Constitution des Benzols
 | url = https://archive.org/download/crossref-pre-1909-scholarly-works/10.1002%252Fcber.18860190141.zip/10.1002%252Fcber.188601902285.pdf
 | volume = 19}}</ref>

<ref name=trudeau>{{citation
 | last = Trudeau | first = Richard J.
 | isbn = 978-0-486-67870-2
 | location = New York
 | pages = 68–70
 | publisher = Dover Publications
 | series = Dover Books on Mathematics
 | title = Introduction to Graph Theory
 | year = 1993}}</ref>

<ref name=tutte>{{citation
 | last = Tutte | first = W. T. | author-link = W. T. Tutte
 | doi = 10.1017/s0305004100023720
 | journal = [[Proceedings of the Cambridge Philosophical Society]]
 | mr = 21678
 | pages = 459–474
 | title = A family of cubical graphs
 | volume = 43
 | year = 1947| issue = 4 | bibcode = 1947PCPS...43..459T | s2cid = 123505185 }}</ref>

<ref name=wh07>{{citation
 | last1 = Walter | first1 = D.
 | last2 = Husty | first2 = M. L.
 | editor1-first = Jean-Pierre | editor1-last = Merlet
 | editor2-first = Marc | editor2-last = Dahan
 | contribution = On a nine-bar linkage, its possible configurations and conditions for paradoxical mobility
 | contribution-url = https://geometrie.uibk.ac.at/obsolete/institutsangehoerige/husty/dld/A681.pdf
 | publisher = [[International Federation for the Promotion of Mechanism and Machine Science]]
 | title = 12th World Congress on Mechanism and Machine Science (IFToMM 2007)
 | year = 2007}}</ref>

}}

==External links==
* [http://www.cut-the-knot.org/do_you_know/3Utilities.shtml 3 Utilities Puzzle] at [[Cut-the-knot]]
* [http://www.archimedes-lab.org/How_to_Solve/Water_gas.html The Utilities Puzzle] explained and "solved" at [[Archimedes-lab.org]]
* {{MathWorld|title=Utility graph|id=UtilityGraph|mode=cs2}}

[[Category:Topological graph theory]]
[[Category:Mathematical puzzles]]
[[Category:Unsolvable puzzles]]