Handbook of Graph Theory

This article was downloaded by: 10.3.98.104 On: 25 Sep 2021 Access details: subscription number Publisher: CRC Press Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office: 5 Howick Place, London SW1P 1WG, UK

Jonathan L. Gross, Jay Yellen, Ping Zhang

History of Graph Theory

Publication details https://www.routledgehandbooks.com/doi/10.1201/b16132-3 Robin J. Wilson Published online on: 17 Dec 2013

How to cite :- Robin J. Wilson. 17 Dec 2013, History of Graph Theory from: Handbook of Graph Theory CRC Press Accessed on: 25 Sep 2021 https://www.routledgehandbooks.com/doi/10.1201/b16132-3

PLEASE SCROLL DOWN FOR DOCUMENT

Full terms and conditions of use: https://www.routledgehandbooks.com/legal-notices/terms

This Document PDF may be used for research, teaching and private study purposes. Any substantial or systematic reproductions, re-distribution, re-selling, loan or sub-licensing, systematic supply or distribution in any form to anyone is expressly forbidden.

The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date. The publisher shall not be liable for an loss, actions, claims, proceedings, demand or costs or damages whatsoever or howsoever caused arising directly or indirectly in connection with or arising out of the use of this material. i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i iuu akta rse aho h ee rde fKoisegeatyoc n if See and found. — be once Königsberg can exactly of walk concerning bridges closed seven a the whether of so, each crosses that walk tinuous The Problem a Königsberg Bridges of The concept (1806–95) the Kirkman to Penyngton an led Thomas (1805–65) of Revd. Hamilton concept Rowan the by William the polyhedra Sir to on and cycles led of subsequently study which The (1735), problem bridges Traversability 1.3.1 in found be can information Further of time. solution in that his [Wi99]. strands since presented or important theory [BiLlWi98] (1707–83) some graph Euler summarizes of Leonhard development chapter the when This 1735 problem. to Königsberg bridges back the traced be can INTRODUCTION 1.3 Section Theory Graph of History 1.3. Section lhuhtefis eto fagahwsntutl17,gahtertclideas graph-theoretical 1878, until not was graph a of mention first the Although h rgn fgahter a etae akt ue’ oko h Königsberg the on work Euler’s to back traced be can theory graph of origins The ¨ ngbr rde problem Königsberg bridges .. rp Algorithms Graph References Colorings Graph 1.3.5 Graphs Topological 1.3.4 Trees 1.3.3 Traversability 1.3.2 1.3.1 ueingraphs eulerian oi .Wlo,Pmrk olg,Ofr nvriy UK University, Oxford College, Pembroke Wilson, J. Robin catr”—21/14—1:5—pg 1—#31 — 31 page — 13:35 — 2013/11/4 — “chapter1” itr fGahTheory Graph of History ...... iue131 h ee rde fKönigsberg. of bridges seven The 1.3.1: Figure ...... a ...... itrdi iue131 sswehrteei con- a is there whether asks 1.3.1, Figure in pictured , c ...... B ...... A C b d § . o oeetniedsuso fissues of discussion extensive more for 4.2 c g D aitna graph Hamiltonian ueingraph eulerian

46 45 41 38 35 31

31 . .

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i ai eosrto i o perutlarltdrsl a rvdb .Hierholzer C. it. by prove proved not was did result but related so, a 1873. be until in should appear this [Hi:1873] not why did reason demonstration heuristic valid a A gave or and eulerian, possible, is an route has graph a F8: which under conditions the trail. to semi-eulerian, correspond results These of number the twice to “handshaking equal F7: is the graph call a now bridges. in of graph-theorists vertex-degrees number some the the twice of what edges. to sum of up the add appearance that together first lemma”, etc. the C, B, is A, This letters the to next written F6: adjacent has problem are Königsberg bridges CD the argument and counting that BD, a proving bridges by AD, thereby solution. two showed exists, pairs no He the sequence the such to bridges). and remaining no C), areas) (corresponding the that land and twice to (the A adjacent D (corresponding between or once are and C, just AC B, B A, and and letters AB A eight between of pairs sequence the a find that to such trying of one as problem and bridges of F5: arrangements general with concerned are areas. remainder land the and problem, 1741, until the appear of not F4: edition did new it the in 1736, republished dated later Although was and pertinentis”. situs geometriam of ad geometry the Petropolitanae in Imperialis entiarum situation its on F3: and problem the of nature [HoWi04]. the position on Petersburg, views his St. bridges. lining seven of the Sciences across of walk F2: continuous Academy such the no to is there position” that of proving geometry Russia, the to relating F1: 1] Chapter [BiLlWi98, FACTS 32 • • • ue E:76 ethsslto ftepolmt the to problem the of solution his sent [Eu:1736] Euler ue i o rwagahi re osletepolm u erfruae the reformulated he but problem, the solve to order in graph a draw not did Euler ue’ ae sdvddit 1scin,o hc r nteKönigsberg bridges the on are 9 which of sections, 21 into divided is paper Euler’s ndsusn h eea rbe,Elrfis bevdta h ubro bridges of number the that observed first Euler problem, general the discussing In n2 uut13 enadElrgv etr n“h ouino problem a of solution “The on lecture a gave Euler Leonhard 1735 August 26 On ue’ ancnlsosfrtegnrlstainwr sfollows: as were situation general the for conclusions main Euler’s ue oe h ovrersl,ta fteaoecniin r aifid hna then satisfied, are conditions above the if that result, converse the noted Euler ftenme fbigsi d o xcl w ra,te h ore spossible is journey areas. the two then these areas, then of two lead, exactly either bridges for in odd of starts is it number bridges if odd of an number which the If to impossible. areas is two journey than a such more are there If f nly hr r oaest hc nodnme fbigsla,te the then lead, bridges of number area. any odd from an starting which accomplished to be areas can no journey required are there finally, If, n13,Elrcmuiae i ouint eea te ahmtcas out- mathematicians, other several to solution his communicated Euler 1736, In catr”—21/14—1:5—pg 2—#32 — 32 page — 13:35 — 2013/11/4 — “chapter1” ne h il Sltopolmtsa geometriam ad problematis “Solutio title the under hpe .Itouto oGraphs to Introduction 1. Chapter Commentarii omnai cdmiSci- Academii Commentarii

n1752. in

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i em ohv entefis ouetegahi iue132t ov h problem. the solve to 1.3.2 by Figure out in pointed graph was the It use to century. first 19th the the been have in of to [Ro:1892] end seems Ball the Rouse until W. recognized W. not was puzzles F12: eulerian of number the determining Tarry. graph of G. complete problem the the essentially in is tours This dominoes. of ring print. in F11: appeared book “topology” the word in the appeared that latter place The first [Li:1847]. the Listing B. J. modern and odd In of graphs value. F10: complete and possible in odd, each trails is for eulerian points with arrangement of concerned number an order. is the such question when finding the only for terminology, possible method is a solution gave a that noted Poinsot problem: following the posed he F9: Such early 1] some Chapter strokes. are [BiLlWi98, there connected FACTS example, for of – number years of possible hundreds fewest many examples. back African the traced with be of can diagram puzzles that given was a study draw of area related A Puzzles Diagram-Tracing Theory Graph of History 1.3. Section n10 .Pist[o10]woeammi nplgn n oyer nwhich in polyhedra and polygons on memoir a wrote [Po:1809] Poinsot L. 1809 In h w nso h hedji padtettllnt seult h sum the to equal is length total that the so and ways, distances. up a possible mutual join arrange all the thread to all in the required two of of by is ends two it two them space, the uniting in thread random flexible at single situated points some Given te iga-rcn uze eepsdadsle yT lue [Cl:1844] Clausen T. by solved and posed were puzzles diagram-tracing Other h oncinbtenteKoisegbigspolmaddiagram-tracing and problem Königsberg bridges the between connection The n14,O eqe se o h ubro aso aigotacomplete a out laying of ways of number the for asked Terquem O. 1849, In iue132 os alsgaho h ¨ngbr rde problem. Königsberg bridges the of graph Ball’s Rouse 1.3.2: Figure catr”—21/14—1:5—pg 3—#33 — 33 page — 13:35 — 2013/11/4 — “chapter1” A K c a 7 n a ovdb .Ris[e17–]adltrby later and [Re:1871–3] Reiss M. by solved was and , ahmtclRcetosadProblems and Recreations Mathematical d C b b B iga-rcn puzzles diagram-tracing e g f D hr n srqie to required is one where , osuinzrTopologie zur Vorstudien os Ball Rouse .

33 ,

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i aldteioingm seFgr ..) nwihtepae a hlegdt find to challenged was conditions. player extra the certain satisfying which game, dodecahedron, a in invented solid 1.3.4), subsequently a Figure on He (see cycles dodecahedron. such game a icosian of the vertices called the all through passing F15: (see bee” a of cell the every two that and in proved cycle, “cutting He such by no obtained once. has polyhedron vertices 1.3.3). just the of Figure vertices number example the odd an all an as and gave through faces passing even-sided cycle with polyhedron a find can one Vandermonde hundreds A.-T. many F14: [Eu:1759], back Euler dated by be once given just can were others. squares problem solutions and 64 This [Va:1771], systematic the and point. of years, each starting of visiting the chessboard, to a returning on and moves knight’s of succession F13: of consideration problem. 2] Hamilton’s general Chapter more to [BiLlWi98, FACTS the prior of considered who, Because below, Kirkman, discussed graph. after as of given named dodecahedron, that a the being of is justly vertex problem called each more now eulerian through are of the once graphs such resembles just influence, passes superficially Hamilton’s that that cycle problem a graph finding of type A Graphs Hamiltonian 34 n15 ika K:86 rt ae netgtn hs oyer o which for polyhedra those investigating paper a wrote [Ki:1856] Kirkman 1856 In rsn rmhswr nnncmuaieagba aitncniee cycles considered Hamilton algebra, non-commutative on work his from Arising neryeapeo uhapolmi the is problem a such of example early An catr”—21/14—1:5—pg 4—#34 — 34 page — 13:35 — 2013/11/4 — “chapter1” iue133 ika’ cl fabe example. bee” a of “cell Kirkman’s 1.3.3: Figure iue134 aitnsioingame. icosian Hamilton’s 1.3.4: Figure W VT XN HM JL Z G D B C Q R K F P aitna graphs hamiltonian hpe .Itouto oGraphs to Introduction 1. Chapter ngtstu problem tour knight’s S (see

fﬁdn a ﬁnding of , § .) instead 4.5),

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i rnfrainadtervrino eiss,Cye C:87 a e oteenumer- the to led was [Ca:1857] trees. Cayley rooted serieses”, of of ation reversion the and transformation F19: own their in [PóRe87] interest 3] of Chapter in of counting [BiLlWi98, discussed FACTS topic the is in fascinating graphs of tools a kinds fundamental providing various of be as Enumeration the to well right. in came as problem soon a molecules, with they chemical connection but in calculus, arose first differential trees involving techniques Enumeration Trees Counting molecules. chemical Cayley certain in Arthur of others, by enumeration and used Pólya the (1887–1985), were the Georg with trees in (1806–97), connection Sylvester Later, ideas Joseph networks. graph-theoretical James employed electrical (1821–95), in who currents (1824–87), of Kirchhoff calculation Gustav of work the Trees 1.3.2 others. and (1973), Meyniel H. others. and Chvátal [BoCh76], V. F18: and Bondy A. J. [Or60], Ore O. [Di52], Dirac F17: (see 1946 in [Tu46] Tutte T. W. by disproved subsequently 1.3.5). was Figure assertion This cycle. F16: Theory Graph of History 1.3. Section h ocp fate,acnetdgahwtotcce,apae mlctyin implicitly appeared cycles, without graph connected a tree, a of concept The ucetcniin o rp ob aitna eeltrotie yG A. G. by obtained later were hamiltonian be to graph a for conditions Sufficient hl okn napolmisie ysm oko yvse n“differential on Sylvester of work some by inspired problem a on working While aitna irpshv lobe netgtd yA hul-or (1960), Ghouila-Houri A. by investigated, been also have digraphs Hamiltonian n18,P .Ti setdta vr -aetplhdo a hamiltonian a has polyhedron 3-valent every that asserted Tait G. P. 1884, In iue135 ut’ -aetnnhmloinpolyhedron. non-hamiltonian 3-valent Tutte’s 1.3.5: Figure catr”—21/14—1:5—pg 5—#35 — 35 page — 13:35 — 2013/11/4 — “chapter1” § 6.3.

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i tes h edo rpia nmrto se[aa3)wssbeunl further others. subsequently and was [Re63], [HaPa73]) Read C. (see R. enumeration [Ha55], graphical Harary F. of by field developed The others. but the [Re27], F25: of development Redfield the H. group on influence J. a no by of had that anticipated action and theorem written the was subject. powerful obscurely Pólya’s under work was a of configuration paper obtain of Some Redfield’s to types permutation symmetries. certain a enumerate of of to that him with enabled function generating his a Prüfer [Pr18]: and H. trees F24: by labeled given such was between proof correspondence accepted one-to-one length first a of establish The sequences to general. was in method proof a give and with molecule trees or molecules, tree chemical the F23: of to centroid applied or he center which the method, at outwards. starting working This of essentially trees. consisted unrooted counting of F22: the and numbers few first F21: the calculate to able was he equality, this Using product the to equal is function generating Letting 1.3.6). Figure (see trees rooted smaller of number a F20: 36 alysmto a otk otdte n eoeisro,teeyobtaining thereby root, its remove and tree rooted a take to was method Cayley’s rud17,SletradC odnidpnetydfie the defined independently Jordan C. and Sylvester 1870, Around n17,Cye C:84 on ehdfrsligtemr icl problem difficult more the solving for method a found [Ca:1874] Cayley 1874, In n18,Cye C:89 rsne his presented [Ca:1889] Cayley 1889, In ae eut nteeueaino re eedrvdb .Otr[t8 and [Ot48] Otter R. by derived were trees of enumeration the on results Later nafnaetlppro 97 ´la[´3]cmie h lsia daof idea classical the Pólya [Pó37] combined 1937, of paper fundamental a In A centroid/bicentroid n n catr”—21/14—1:5—pg 6—#36 — 36 page — 13:35 — 2013/11/4 — “chapter1” etenme froe re with trees rooted of number the be etcs eepandwytefruahlswhen holds formula the why explained He vertices. n − (1 omdfo h ubr 1 numbers the from formed 2 iue136 pitn otdtree. rooted a Splitting 1.3.6: Figure − x fatree. a of root + 1 ) − 1 A · (1 1 x − + x A 2 ) 2 − x A 2 1 + · n A (1 n 3 − n − x hpe .Itouto oGraphs to Introduction 1. Chapter 2 3 rnhs alypoe htthe that proved Cayley branches, x oml o h ubro labeled of number the for formula + , 3 2 ) . . . n , . . . , − A root 2 · . . . . n

A ,bth i not did he but 6, = n

n tatime. a at one , center/bicenter

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i hswstefis perneo h word the of appearance first the was This a wrote and [Sy:1877–8] Cayley Sylvester which 1878, to In topic in a contributions. note theory, significant short invariant made in had quantics Sylvester binary and atoms chemical F28: followiing the for molecules; alkanes of of families isomers other various of as number well the as gives atoms, table carbon 11 to up with F27: chemical with isomers shows chemical 1.3.8 same Figure the with properties. (isomers) chemical molecules formula of different pairs but exist formula there whereby isomerism, of F26: 4] Chapter [BiLlWi98, FACTS tree corresponding the and 1.3.7 drawing, Figure usual the molecules. Alexander representing when ethanol, graph. this for particularly of formulae Around representation established, graphic his be substances. presents his to such presented began form Brown valency proportions. to Crum of combine fixed ideas elements in chemical the combine time, how elements understood chemical not that was as known such already formulas was Chemical it 1850 By Trees Chemical Theory Graph of History 1.3. Section dnia ihaKklendarmo chemicograph. or Kekuléan a diagram by a expressible with becomes identical thus covariant and invariant Every Formula ubr111235918 9 5 3 2 1 1 1 Number .K lffr n yvse eivdta oncincudb aebetween made be could connection a that believed Sylvester and Clifford K. W. aly[a17]ue recutn ehd oeueaeprffis(alkanes) paraffins enumerate to methods tree-counting used [Ca:1874] Cayley rmBonsgahcntto xlie o h rttm h phenomenon the time first the for explained notation graphic Brown’s Crum C 4 H 10 Nature . HH CH catr”—21/14—1:5—pg 7—#37 — 37 page — 13:35 — 2013/11/4 — “chapter1” iue138 w smr:btn n isobutane. and butane isomers: Two 1.3.8: Figure HH HH 4 H C bu hsspoe oncin eakn that: remarking connection, supposed this about CC iue137 ersnain fethanol. of Representations 1.3.7: Figure C H 2 H O CH 6 HH H 4 C 3 mtae and (methane) H H H CO 8 HH H H H C 4 H H H H graph 10 C HH H 5 C n ntegahtertcsense. graph-theoretic the in H 2 1 = CC H 12 5 HH OH , . . . , C H C C H 6 H ehnl eekon u it but known, were (ethanol) 8. 14 H C H H 7 H graph 16 C precisely 8 H 18

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i hr r nyfierglrcne oyer,adh niiae h dao duality of idea the anticipated he and polyhedra, convex regular five only are there of triangulation a F34: considering and plane graph. a planar onto resulting polyhedron the the projecting graphically 1794, in F33: [Le:1794] Legendre polygons. A.-M. by spherical given of was properties proof valid metrical first using The deficient. was it but F32: angles solid faces, of number by the Denoting (edges) joints Goldbach. and C. (vertices) to Euler from 1750, November F31: [BeWi09] [Cr99] deduction. 5] a Chapter concept such no [BiLlWi98, make FACTS had to from Descartes unable results since was However, obtained he derived. edge, he be an and later of polyhedra, could formula studied René Euler’s Descartes which century, 17th the In they that evidence no numbers polyhedron: is a the there of between but faces connection solids, regular simple five the the knew with familiar were Greeks The Formula Polyhedron Euler’s order higher the Neil to by results notably these extended – has work than – recent other others and sphere surfaces. surfaces and the (1896–1980), to Seymour, in extended Kuratowski Paul imbeddable later graphs Robertson, Kazimierz of was by characterization It fundamental given a graphs. was 1930, planar In for sphere. also the holds it since ory, Graphs Topological 1.3.3 problem counting the permutation molecules. of solved importance of paper Pólya’s the families above-mentioned recognized several and [LuSe29] for area, Senior this K. J. for and groups Lunn C. A. 1930s. F30: the of volume first the in Mathematics theory invariant and molecules chemical F29: 38 yntn htfu fte cu nrcpoa ar.H lofudtretpsof types three found those also faces, He their in indentations pairs. with reciprocal those in – fails occur formula them Euler’s which of for four polyhedra that noting by • the- graph topological for foundation the was [Eu:1750] formula polyhedron Euler’s neeysldecoe ypaefcsteageaeo h ubro ae and faces of or number edges, of the number of the two aggregate by the exceeds angles faces solid plane of by number the enclosed solid every In ue a nbet rv i oml.I 72h tepe ro ydissection, by proof a attempted he 1752 In formula. his prove to unable was Euler rudtesm ie .A-.Lule L:81 aeatplgclpofthat proof topological a gave [Lh:1811] Lhuilier S.-A.-J. time, same the Around n17,Sletr[y17]woealntyatceo h rpi prahto approach graphic the on article lengthy a wrote [Sy:1878] Sylvester 1878, In n11,A-.Cuh C:83 bandapofo ue’ oml ystereo- by formula Euler’s of proof a obtained [Ca:1813] Cauchy A.-L. 1813, In h rtapaac fteplhdo oml perdi etr ae 14 dated letter, a in appeared formula polyhedron the of appearance first The itepors a aeo h nmrto fioesutlte12sand 1920s the until isomers of enumeration the on made was progress Little catr”—21/14—1:5—pg 8—#38 — 38 page — 13:35 — 2013/11/4 — “chapter1” hc ehdrcnl founded. recently had he which , H , S V and , − E A + ewrote: he , F 2 = hpe .Itouto oGraphs to Introduction 1. Chapter V fvertices, of E mrcnJunlof Journal American fegs and edges, of H + S =

F 2. + of

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i F37: 8] Chapter [BiLlWi98, FACTS by demonstrated subsequently was as planarity, to obstructions com- main Kuratowski. the the involving problems are recreational 1.3.9) two in originated graph graphs plete planar of study The Graphs Planar Mathematical American the for situs analysis 1916. on in lectures colloquium Society of series ten-volume a the in in [Ve22] (topology) Wissenschaften situs Mathematischen analysis der on [DeHe07] Heegaard P. topology. and algebraic for foundations the the F36: in laid ideas influential that Listing’s be 1895–1904 up Poincaré to of took H. proved papers affect particular, work his properties In in This topological topology. formula. of their development Euler’s how subsequent of studied above and generalization the complexes, into investigation sive F35: 2 number The then drawn, is if map that, polyhedral prove a to which discussion his extended the and derived Lhuilier polyhedra, ring-shaped such polyhedra For is, (that torus them). a through formula on ‘tunnel’ drawn polyhedra a ring-shaped with and cavity, interior an with Theory Graph of History 1.3. Section − 2 g fec einsol aeafote iei omnwt aho h other satisfied? the be of will each the boundary with of the common terms that in the line so Can frontier regions a death regions. five his have four after into should that kingdom region stated he each the will of divide his In should sons. sons five the with king a once was There rudteya 80 .F ¨bu rsne h olwn uzet i students: his to puzzle following Möbius the F. presented A. 1840, year the Around ona´’ okwsisatyscesu,adi perdi natceb .Dehn M. by article an in appeared it and successful, instantly Poincaré’s was work n16–,Lsig[i16–]wrote [Li:1861–2] Listing 1861–2, In scle the called is K g 5 snwcle the called now is n h opeebpriegraph bipartite complete the and iue139 h uaosigraphs Kuratowski The 1.3.9: Figure catr”—21/14—1:5—pg 9—#39 — 39 page — 13:35 — 2013/11/4 — “chapter1” ue characteristic Euler eu ftesurface the of genus V − V i da eefrhrdvlpdb .Veblen O. by developed further were ideas His . E − + E (See . F + e essräumliche Complexe Census Der 2 = F g stenme ftnesi ufc on surface a in tunnels of number the is 0 = − § K 7.1.) 2 3 g , 3 hs rps(hw nFigure in (shown graphs These . K n h au ftequantity the of value the and , 5 and K 3 , 3 . Encyklopädie nexten- an ,

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i rp rw ihu rsig napaecrepns(yseegahcprojection) stereographic (by corresponds plane a on crossings without drawn graph A Surfaces Higher to on 1950s Graphs late (see the graph in a from ideas clarifies arise and these to extends used matroid matroid [Tu59] a a Tutte for of criterion and dual Kuratowski-type graphs, The a planar obtain matroid. a of of duality concept the the others. to and spaces and MacLane vector if S. by planar obtained is were graph results planar F41: Related a duality, for dual. of duality abstract definition an of general has it definition this if with geometrical only that, the proved with He agrees graphs. and combinatorial purely F40: Smith. A. P. and Frink O. to by homeomorphic subgraph independently a has graph nonplanar F39: whether deciding of that is problem This problem electricity graph the whether deciding F38: of that is problem the formulation, dual this In formulated later version, dual its from seen be plane. the can Tietze: in H. theory regions by neighboring graph mutually with five draw connection can The one whether asks question This 40 oagahsmlrydano h ufc fashr.Ti ed oteie fgraphs of in idea out, the carried was to area leads this in This work sphere. initial The a sphere. of the surface than the other surfaces on on drawn drawn similarly graph a to aho h he oss ,B n ,wtotaypp rsiganother to crossing E, pipe and any G, without W, C, from and electricity, B, and A, 1.3.10). gas, houses, Figure water, (see three on the lay of to each is puzzle The done? be this Can his intersect. of roads cities two capital five no the that join so should roads sons by the kingdom that stated further king The nodpolm hs rgn r bcr,i the is obscure, are origins whose problem, old An n13 .Winy[h1 icvrda btatdfiiino ult htis that duality of definition abstract an discovered [Wh31] Whitney H. 1931 In n13 hte W3]gnrlzdteie fidpnec ngah and graphs in independence of idea the generalized [Wh35] Whitney 1935 In n13 uaosi[u0 ulse eertdpprpoigta every that proving paper celebrated a published [Ku30] Kuratowski 1930 In catr”—21/14—1:5—pg 0—#40 — 40 page — 13:35 — 2013/11/4 — “chapter1” etoe yH uee D1]i the in [Du13] Dudeney H. by mentioned , iue131:Tegswtreetiiyproblem. gas–water–electricity The 1.3.10: Figure W A K B G 3 , 3 splanar. is K hpe .Itouto oGraphs to Introduction 1. Chapter 5 or tlte problem utilities K C E 3 , tadMagazine Strand 3 hsrsl a obtained was result this ; or ,

gas–water– 5 § 6.6). splanar. is f1913: of

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i oteda rbe fclrn h etcso lnrgahado rpsi general. in graphs of and graph planar turned a of had Heesch, vertices attention the Heinrich Daniel Meanwhile, coloring Robertson, Birkhoff, of [1997]. Neil problem George Thomas by dual Robin produced the Kempe, subsequently to and of was Seymour, work proof Paul simpler earlier Sanders, Haken a Wolfgang the 1879. and and in others, on Appel appeared and building Kenneth Kempe by Bray 1976, Guthrie proved Alfred Francis eventually in by by was “proof” theorem posed (incorrect) four-color first celebrated The was a This and 1852, problem. in four-color celebrated the particular, Colorings Graph 1.3.4 [GlHuWa79] Wang S. plane. C. projective and the Huneke, for P. subgraphs J. is forbidden Glover, there 103 H. surfaces, of H. non-orientable set 1979 For a in obtained torus. and the result, for similar even a hundreds, into genus runs orientable subgraphs each (see for finite that, is subgraphs” proved [RoSe85] Seymour and a F46: to dualization its with using combinatorial object, [RiYo68], specialized topological Youngs of unified types (see and numerous a a of into Ringel [Gr74] mid- of graphs by Gross the current 1963 L. in 1968 J. in settled by in inspiration were transformation involving the combinatorial completed these difficult, of [Gu63] was more Most Gustin’s proof much W. cases. the be separate to 12 and proved of 1960s, surfaces consideration of orientable pages for 300 proof The Ringel. non-orientable of surfaces this F45: for the but formula to the bottle, exception 6. proved an Klein and [Ka35] was 4, the it Kagno corre- that 3, N. for found genus a I. it who stated [Fr34], 1935, prove Franklin In P. and to by formula. plane, 1934 unable in projective was settled the was He case and formula. Möbius band Heawood the sponding as such surfaces. surfaces, other able certain Heawood’s and that genus proved low F44: he of and surfaces torus, orientable the for and correct sphere is the formula than complete other deficient. given surfaces was a orientable formula which this on of surface proof a F43: attempted of genus his the but for imbedded, formula be a can derived graph also He torus. a F42: Ri74] Paul 7; 1980s. and Chapter the and Robertson [BiLlWi98, in Ringel FACTS Neil surfaces Gerhard and other until 1960s to solved the theorem non-orientable not in Kuratowski’s were for conjecture generalized area Heawood Seymour (1880–1964) the the Tietze in solved Heinrich Youngs problems Ted basic by (1862– the and Heffter but Lothar surfaces, surfaces, and (1861–1955) orientable Heawood for Percy by 1962) maps, coloring of context the Theory Graph of History 1.3. Section al oko ooig ocre h ooigo h onre fampad in and, map a of countries the of coloring the concerned colorings on work Early § .) a e osmlrsltos(e rs n .W ukr[GrTu74]). Tucker W. T. and Gross (see solutions simpler to led has 7.4), n19,Haod[e19]peetda medn ftecmlt graph complete the of imbedding an presented [He:1890] Heawood 1890, In n11,H ite[i0 xeddHffe’ osdrtost eti non-orient- certain to considerations Heffter’s extended [Ti10] Tietze H. 1910, In h ewo oml o eea o-retbesrae a rvdi 92by 1952 in proved was surfaces non-orientable general for formula Heawood The n19,L etr[e19]ivsiae h medn fcmlt rpson graphs complete of imbedding the investigated [He:1891] Heffter L. 1891, In nasqec fppr nte18so ra ahmtcldph Robertson depth, mathematical great of 1980s the in papers of sequence a In catr”—21/14—1:5—pg 1—#41 — 41 page — 13:35 — 2013/11/4 — “chapter1” § .) oee,aatfo h pee h ubro forbidden of number the sphere, the from apart However, 7.7). urn graph current g h e f“forbidden of set the , ic then, Since . otg graph voltage

7 on 41

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i oddc h v-oo hoe,adgnrlzn h rbe nvroswy,sc as such ways, various in problem (see the surfaces generalizing other and theorem, for five-color the deduce to Mathematics Applied and time Victorian the this and at London), F52: problem of four-color (Bishop Temple the Wilson. F. in M. Carroll), J. interested (Lewis educator people Dodgson Other L. C. fallacious. were them of all (where a pentagon contains F51: the that a fallacious. for map was included argument color-interchanges) a his solution simultaneous for but two His proof correct, used Kempe’s was he country. quadrilateral interchanged. a or are triangle, such map digon, include the the of of to section coloring must a extended any colored as map how be known showed every now can he technique, that map and new showed neighbours, the Kempe five of most Sylvester. at rest with by country the founded a in contain been theorem recently four-color had the which of proof restrict purported to a sufficient note is short it F50: that a showed published he he maps. trivalent and after, to lie, Shortly attention might one’s difficulty solved. the been where had describing problem printed the earlier whether An asked problem. the in F49: the interest in life-long appeared a “F.G.”, developed by signed who unsigned reference, Peirce, an in S. print, in C. appeared by problem the the 1860, in April review 10 book On lies. the difficulty in the where interested not was Hamilton F48: England. of map formulated who a Francis, as of brother counties himself problem. his the identified to coloring that problem later way while the student a it for such The in credit colors giving differently. four Guthrie, just student Frederick colored a with how colored are described be countries Morgan can De map neighbouring every 1852. whether October him 23 asked dated had Hamilton, to Morgan De A. F47: cele- the [Wi02] solve 6] to Chapter attempts maps. [BiLlWi98, FACTS of to coloring back the traced on be problem can four-color theory brated graph in developments Many Vizing Problem other G. Four-Color on V. The maps of coloring 1968. theorem of in fundamental problem Youngs and a starting corresponding Ringel graph, to the by a leading earlier, settled of was mentioned and edges surfaces As the [1880], of Tait 1964. coloring of in the result in development a parallel with a also was There 42 h rbe,tels hl ewsi i 0hya.Kmeamte i ro,bthe but error, his admitted Kempe year. 90th right. his it in put was to he unable while was last the problem, the n18,Ti T:888]peetd“mrvdpof”o h orclrtheorem, four-color the of proofs” “improved presented [Ta:1878–80] Tait 1880, In eMra rt ovrosfins ulnn h rbe n rigt describe to trying and problem the outlining friends, various to wrote Morgan De n19,Haod[e19]pbihdappri the in paper a published [He:1890] Heawood 1890, In h aletkonmnino h orclrpolmocr nalte from letter a in occurs problem four-color the of mention known earliest The n1 ue17,a etn fteLno ahmtclScey Cayley Society, Mathematical London the of meeting a at 1878, June 13 On n17,Kme[e17] omrCmrdesueto aly published Cayley, of student Cambridge former a [Ke:1879], Kempe 1879, In catr”—21/14—1:5—pg 2—#42 — 42 page — 13:35 — 2013/11/4 — “chapter1” Athenaeum § ..) ewo usqetypbihdaohrsxppr on papers six another published subsequently Heawood 1.1.3). onigotteerri ep’ ro,slaigenough salvaging proof, Kempe’s in error the out pointing , rte yD ogn hsrve a edi h U.S. the in read was review This Morgan. De by written , Kempe-chain Athenaeum ruet nwihteclr natwo- a in colors the which in argument, hpe .Itouto oGraphs to Introduction 1. Chapter mrcnJunlo Mathematics of Journal American n15 [McK12]. 1854 in urel ora fPure of Journal Quarterly

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i ae prah n hyotie nuaodbesto 3 euil configurations. reducible 633 Appel– of the unavoidable set systematized the unavoidable they both an solution, with obtained the assist they of and to parts approach, computer configuration Haken a reducible Using the and proof. set systematic more a test duced to computer a F58: of proving use thereby substantial configurations, required reducibility. for solution reducible configurations Their 1482 the of theorem. set four-color unavoidable the an obtained Koch, reducible of thousands F57: produced [He69] Heesch years, few next configurations. the Over 25 figurations. to authors. up other with by maps times F56: all several for increased true later is was theorem number four-color This the that countries. deduced he and urations, F55: polynomial chromatic with F54: theorem. (known 1.3.12 four-color Figure the in pentagons configuration: to four the counter-example of to the any arrangement extended as the be in that can showed appear map [Bi13] can the Birkhoff of configuration rest such the of no coloring any that property a of that is second The sets Unavoidable H. map. by any and Franklin, in P. by an appear 1.3.11), of must Figure that (see which [We:1904] is Lebesgue. Wernicke of P. first one by The produced least were at paper. Kempe’s configurations, in of origin its finds F53: Theory Graph of History 1.3. Section k n11,Brhff[i2 netgtdtenme fwy fclrn ie map given a coloring of ways of number the investigated [Bi12] Birkhoff 1912, In n12,Faki F2]peetdfrhruaodbest n euil config- reducible and sets unavoidable further presented [Fr22] Franklin 1922, In iko diamond Birkhoff rud15 eshsatdt erhfra nvial e frdcbecon- reducible of set unavoidable an for search to started Heesch 1950 Around rud19,Rbrsn adr,Syor n hms[oaeh7 pro- [RoSaSeTh97] Thomas and Seymour, Sanders, Robertson, 1994, Around oos n esoe htti sawy oyoilin polynomial a always is this that showed he and colors, uigtefis afo h 0hcnuytoieseegd aho which of each emerged, ideas two century 20th the of half first the During n17,ApladHkn[pa7 pao7,wt h sitneo J. of assistance the with ApHaKo77], [ApHa77, Haken and Appel 1976, In digon catr”—21/14—1:5—pg 3—#43 — 43 page — 13:35 — 2013/11/4 — “chapter1” triangle ftemap. the of iue131:Wrik’ nvial set. unavoidable Wernicke’s 1.3.11: Figure euil configuration reducible iue131:TeBrhffdiamond. Birkhoff The 1.3.12: Figure sardcbeconfiguration. reducible a is ) quadrilateral ofiuaino onre ihthe with countries of configuration a — two pentagons nvial set unavoidable pentagon andhexagon k o aldthe called now , set a —

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i eua rps rsn rmapolmi h hoyo nains nti ae he paper this In invariants. of theory the in problem a from arising graphs, regular Petersen Julius F67: by out 10] carried Chapter was [BiLlWi98, FACTS (See graphs [1914–2002]. in Tutte A factors T. graph. W. on original and work the [1839–1910] Fundamental as vertex-set same graph. the with each subgraphs, k regular into split be is graph A others and Factorization Behzad M. example, colorings. for list introduced — Erd˝os others P. writers and and 1960s, of the number in colorings a total introduced by generalized been have F66: edge-colorings. on results further many produced Vizing degree maximum F65: a of idea the introduced who F64: (See graphs. complete degree maximum with graphs. Whitney, of of work coloring the F63: the through on mainly thesis 1930s, Ph.D. the in his own wrote its who of life a developed differently F62: degree in maximum colors three vertex. every with colored at F61: be appears can color map each trivalent that every way of a edges such the the on that by workers statement the up subsequent most taken by later F60: and was 1932 vertices map-coloring of adjacent to paper that way approach fundamental problem. a four-color a dual such in in This Whitney graph H. planar differently. a colored of vertices are the coloring of problem F59: [JeTo95] [FiWi77] graph 6] other Chapter on [BiLlWi98, vertices. made FACTS or being edges was of progress coloring problem, the four-color involving the problems on work from Arising Problems Coloring Graph Other 44 w lae” efi ugahjie oters ftegahb igeedge. single a by graph the of rest the to than more joined not subgraph has a it is that provided leaf 1-factor, a a “leaves”; possesses two graph 3-regular any that proved if that proved -factor n14,L ros[r1 rvdta h hoai ubro n ipegraph simple any of number chromatic the that proved [Br41] Brooks L. 1941, In h dao ooigtevrie fagahs htajcn etcsaecolored are vertices adjacent that so graph a of vertices the coloring of idea The nte15s usata rgeso etxclrnswsmd yG .Dirac, A. G. by made was vertex-colorings on progress substantial 1950s, the In nhs17 ae nteclrn fmp,Kme[e17]otie h dual the outlined [Ke:1879] Kempe maps, of coloring the on paper 1879 his In h ocpso h hoai ubradeg-hoai ubro graph a of number edge-chromatic and number chromatic the of concepts The n19,Ptre P:81 rt udmna ae ntefcoiainof factorization the on paper fundamental a wrote [Pe:1891] Petersen 1891, In n18,Ti T:888]poe httefu-oo hoe seuvln to equivalent is theorem four-color the that proved [Ta:1878–80] Tait 1880, In n16,V .Vzn V6]poe htteegso n ipegahwith graph simple any of edges the that proved [Vi64] Vizing G. V. 1964, In n11,D ¨ng[¨1]poe htteegso n iatt rp with graph bipartite any of edges the that König [Kö16] proved D. 1916, In nagahi a is graph a in k catr”—21/14—1:5—pg 4—#44 — 44 page — 13:35 — 2013/11/4 — “chapter1” -regular k see,te any then even, is d d a eclrdwith colored be can a lasb ooe with colored be always can fec fisvrie a degree has vertices its of each if § d k 5.1.) rglrsbrp htcnan l h etcso h original the of vertices the all contains that subgraph -regular sa most at is rtclgraph critical k rglrgahcnb pi no2fcos ealso He 2-factors. into split be can graph -regular d ,wt qaiyol o d ylsadodd and cycles odd for only equality with 1, + d oos (See colors. . § 5.4.) d hpe .Itouto oGraphs to Introduction 1. Chapter

oos ntefloigyear, following the In colors. 1 +

§ k 11.3.) uhgah a sometimes can graphs Such .

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i o nigtemxmmflwo omdt ewe w oe nacapacitated a in nodes determining for two [GoHu61] between Hu C. commodity T. networks. and a multi-terminal Gomory in of E. R. flow by and maximum network, the finding for to due (See algorithm, related (1957). F72: A Prim Boruvka C. [Kr56]. O. R. Kruskal to by B. back rediscovered J. traced was by Jarn´ık be (1931), rediscovered V. can later graph, was weighted and a [Bo26] cities in tree 2392 spanning with minimum-length problem a 1980s (See F71: the [PaRi87]. of In Rinaldi solution and cities. the B. Padberg included G. 49 by that of with settled [DaFuJo54] paper was problem Johnson fundamental salesman M. a was traveling S. to and and Princeton, led a Fulkerson, at form This R. 1930s, rudimentary Corporation. early D. in RAND the Dantzig, appeared the in distance, circles at or mathematical popularized time in later minimum reappeared in It cities 1831. of in number a of tour F70: its as such number, weighted [LoPl86] a [LLRS85] or assigned [Da82] network, it. FACTS been traverse a has to given taken which are time of we the vertex) or problems (and/or length these edge the each of and to each problems, graph, path In longest research. and operational shortest Problem escape the to Postman problem, how Chinese showed connector Tarry minimum G. the and as graph (see eulerian maze an a tracing from for method systematic a Algorithms Graph 1.3.5 that graphs of characterization a to result his extended he a later contain years Five 1-factor. F69: and pentagon (the 2-factor a and spokes) (the 1-factor a into split pentagram). be however, can, it the F68: Theory Graph of History 1.3. Section rp hoyagrtm a etae akt h 9hcnuy hnFer gave Fleury when century, 19th the to back traced be can algorithms theory Graph eesngraph Petersen rp loihswr eeoe yD .FlesnadG .Dnzg[FuDa55] Dantzig B. G. and Fulkerson R. D. by developed were algorithms Graph n19,Ptre P:88 rdcdatiaetgahwt olae,nwcalled now leaves, no with graph trivalent a produced [Pe:1898] Petersen 1898, In h reyagrtmfrthe for algorithm greedy The The n14,Tte[u7 rdcdacaatrzto fgah htcnana contain that graphs of characterization a produced [Tu47] Tutte 1947, In k fco,frany for -factor, rvln aemnProblem Salesman Traveling catr”—21/14—1:5—pg 5—#45 — 45 page — 13:35 — 2013/11/4 — “chapter1” § .) h 0hcnuyswagrtmcsltost uhproblems such to solutions algorithmic saw century 20th The 4.2). seFgr ..3,wihcno esltit he 1-factors; three into split be cannot which 1.3.13), Figure (see iue131:TePtre graph. Petersen The 1.3.13: Figure k (see . § .) swl st ubro rbesaiigin arising problems of number a to as well as 4.3), iiu onco problem connector minimum nwihaslsa ihst aeacyclic a make to wishes salesman a which in , § 4.6.) § 10.1.) nwihoesesa seeks one which in , aiu flows maximum

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i BL4]G .BrhffadD .Lws hoai polynomials, Chromatic Lewis, C. D. and Birkhoff D. G. maps, a of coloring [BiLe46] reducibility of The ways Birkhoff, of D. G. number the [Bi13] for formula determinantal A Birkhoff, D. G. (eds.), [Bi12] Wilson J. R. and Lloyd, K. E. Biggs, L. N. [BiLlWi98] Wilson, J. R. and Beineke W. L. 2, Part [BeWi09] 4-colorable: is map planar Every Koch, J. and Discharg- Haken, W. 1, Appel, Part K. 4-colorable: [ApHaKo77] is map planar Every Haken, W. and Appel K. [ApHa77] References can information Further NP. = P whether [GaJo79]. known not in is found It be NP-hard. of are prob- concept problems spanning-tree cycle the the minimum developed in and later all are others transportation, lems polynomial-time and assignment, a [Ka72], The which Karp for NP-completeness. [Co71], problems Cook discussed [Ed65] exists. Edmonds algorithm and others, than cult polyhedral F77: of programming. subject the linear the of as study known to emerging later newly (See led the [Ha35], with investigations Hall combined were König Philip These and of to combinatorics work due from [HaVa50]. matching developed theorem” work on This result “marriage celebrated qualified. are a they from which and for jobs to possible as [Gu60] Kwan) (Mei-Ku F76: Guan Meigu by originated (See was 1960. graph, weighted in (See given a [Di59]. of Dijkstra edge W. E. to due F75: is known best the which of network, F74: ( CPM and (See submarines project. of a building the involving Method problems for Navy U.S. with 1950s, and 1940s F73: 46 BC7]J .BnyadV h´tl ehdi rp theory, graph in method Chvátal, A V. and Bondy A. J. [BoCh76] 1936 Reducibility, ing, 17) 111–136. (1976), Soc. map, 1998. Press, University Oxford § 11.3.) nmthn n sinetpolm n ihst sinpol sappropriately as people assign to wishes one problems assignment and matching In idn ogs ah rciia ah na ciiyntokdtsfo the from dates network activity an in path, critical or path, longest a Finding h hns ota rbe,frfidn h hretrueta oeseach covers that route shortest the finding for problem, postman Chinese The eeoe yteD otd eor opn omnmz h oa otof cost total the minimize to Company Nemours de Pont Du the by developed ) hr r eea ffiin loihsfrfidn h hretpt nagiven a in path shortest the finding for algorithms efficient several are There ytelt 90 tbcm la htsm rbessee ob oediffi- more be to seemed problems some that clear became it 1960s late the By liosJ Math. J. Illinois abig nvriyPes 2009. Press, University Cambridge , 0(96,355–451. (1946), 60 n.o Math. of Ann. catr”—21/14—1:5—pg 6—#46 — 46 page — 13:35 — 2013/11/4 — “chapter1” § 4.3.) § 3.2.) oyoiltm class polynomial-time liosJ Math. J. Illinois PERT 4(92,42–46. (1912), 14 1(97,429–490. (1977), 21 PormEauto n eiwTcnqe sdb the by used Technique) Review and Evaluation (Program 1(97,429–490. (1977), 21 ,wietetaeigslsa n Hamiltonian and salesman traveling the while P, oisi oooia rp hoy1736- Theory Graph Topological in Topics mr .Math. J. Amer. hpe .Itouto oGraphs to Introduction 1. Chapter rp hoy1736-1936 Theory Graph 5(93,115–128. (1913), 35 rn.Ae.Math. Amer. Trans. iceeMath. Discrete § 10.1.) rtclPath Critical

15 ,

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i E:79 .Elr ouindueqeto uiueqin aotsuieà aucune soumise paroit ne qui curieuse question d’une Solution Euler, L. pertinentis, [Eu:1759] situs geometriam ad problematis Solutio (1736) Euler, flowers, L. and [Eu:1736] trees Paths, Edmonds, R. J. [Ed65] Perplexities, Dudeney, E. H. [Du13] graphs, abstract on theorems Some Dirac, A. G. graphs, [Di52] with connexion in problems two on note A Dijkstra, W. historical E. chapters discovery, [Di59] of philosophy the of review A Morgan, De A. [DeM:1860] situs, Analysis Heegaard, P. and Dehn M. large-scale a [DeHe07] of Solution Johnson, M. S. and Fulkerson, R. D. Dantzig, programming, B. linear G. of [DaFuJo54] origins the about Reminiscences Dantzig, B. G. [Da82] Cromwell, proprietatibus, R. P. ordinis tertii [Cr99] linearum De to] postscript [Second Clausen, T. procedures, [Cl:1844] theorem-proving of complexity The Cook, A. S. [Co71] trees, on theorem A Cayley, A. [Ca:1889] maps, of colouring the On Cayley, A. [Ca:1879] isomers, of theory mathematical the On Cayley, trees, A. called [Ca:1874] forms analytical the of theory the On Cayley, A. [Ca:1857] polyèdres-premier mémoire, les sur Recherches Cauchy, A.-L. [Ca:1813] network, a of nodes the colouring On Brooks, L. R. [Br41] jistém problému O minimáln´ım, Boruvka, O. [Bo26] Theory Graph of History 1.3. Section e.Lett. Res. Nachr. Astron. Computing of Theory Symp. ACM 378. 259–261. (1879), 444–446. 172–176. (1857), 13 tech. 194–197. (1941), 37 37–58. (1926), analyse, Petropolitanae Imperialis Scientiarum Academiae mentarii 221. 1913), 69–81. (1952), 269–271. (1959), 1 D., D. Whewell, W. by critical, and Wissenschaften problem, traveling-salesman Ch 6 11) 68–86. (1813), 16) (Cah. 9 e.Aa.Si Berlin Sci. Acad. Mem. 18) 43–48. (1982), 1 catr”—21/14—1:5—pg 7—#47 — 47 page — 13:35 — 2013/11/4 — “chapter1” 1(84,cl 209–216. col. (1844), 21 10) 153–120. (1907), Polyhedra pr Res. Oper. abig nvriyPes 1999. Press, University Cambridge , 5(79,310–337. (1759), 15 tadMag. Strand p5–5,AM e ok 1971. York, New ACM, pp151–158, , Athenaeum ur.J ueAp.Math. Appl. Pure J. Quart. 15) 393–410. (1954), 2 aa.J Math. J. Canad. rc o.Go.Soc. Geog. Roy. Proc. 6(uy11) 1 n (August and 110 1913), (July 46 nylpai e Mathematischen Encyklopädie der caSc c.Ntr Moravicae Natur. Sci. Soc. Acta o 64(80,501–503. (1860), 1694 No. rc odnMt.Soc. Math. London Proc. rc abig hls Soc. Philos. Cambridge Proc. hl Mag. Phil. 15) 128–140. (1752), 8 7(95,449–467. (1965), 17 rc r Annual 3rd Proc. 3(89,376– (1889), 23 hl Mag. Phil. ue.Math. Numer. .EoePoly- Ecole J. 4 7(1874), 47 (4) nwSr)1 Ser.) (new

Oper. Com- 3 2 (3)

(4) 47 3

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i H6]H esh nescugnzmVierfarbenproblem, zum Untersuchungen Heesch, H. [He69] Heffter, L. [He:1891] theorem, Map-colour Heawood, J. P. [He:1890] Palmer, M. E. and Harary F. graphs, [HaPa73] connected and rooted, directed, unity, linear, of of number roots The Harary, of F. system [Ha55] new a respecting Memorandum Hamilton, R. W. [Ha:1856] problem, marriage The Vaughan, E. H. and Halmos R. P. [HaVa50] subsets, of representatives On Hall, P. [Ha35] graphs, Cayley of embedding Orientable Gustin, W. [Gu63] points, even or odd the using revisiting programming Graphic graphs: Meigu, Guan complete of [Gu60] Quotients Tucker, W. T. and Gross L. J. [GrTu74] graphs, Voltage Gross, L. flows, J. network [Gr74] Multi-terminal Hu, C. T. and Gomory E. R. irreducible are [GoHu61] that graphs 103 Wang, S. C. and Huneke P. J. Glover, H. H. [GlHuWa79] Johnson, S. D. net- and in Garey flow R. maximum M. of [GaJo79] Computation Dantzig, B. G. and Fulkerson R. D. [FuDa55] problem, color six A Franklin, P. [Fr34] problem, network, color four a The through Franklin, P. flow [Fr22] Maximal Fulkerson, R. D. and Ford R. L. Wilson, [FoFu56] J. R. and Fiorini S. [FiWi77] 48 H:83 .Hierholzer, C. [Hi:1873] mr ah Soc. Math. Amer. Mag. Phil. 214–215. (1950), 272–275. (1963), 263–266; (1962), 10 problem, Heawood Math. plane, projective the for NP-Completeness of Theory the works, Math. J. heUtrrcnn uumfahren, zu Unterbrechnung ohne Mannheim-Vienna-Zürich, 1969. Institut, Bibliographisches 810/810a/810b, 477–580. 332–338. 16) 551–556. (1961), 9 aa eerhLgsisQuarterly Logistics Research Naval catr”—21/14—1:5—pg 8—#48 — 48 page — 13:35 — 2013/11/4 — “chapter1” 15) 399–404. (1956), 8 4 2(86,446. (1856), 12 (4) brdsPolmdrNachbargebiete, der Problem das Uber ¨ 8(95,445–463. (1955), 78 aicJ Math. J. Pacific brdeMolcki,ennLnazgon idrougund Wiederholung ohne Lineanzug Möglichkeit, einen die Uber ¨ hns Math. Chinese .Cmi.Theory Combin. J. iceeMath. Discrete .H rea n o,1979. Co., and Freeman H. W. , deCluig fGraphs of Edge-Colourings rpia Enumeration Graphical 16) 273–277. (1962), 1 .Mt.Phys. Math. J. 5(94,391–402. (1974), 55 ah Ann. Math. optr n nrcaiiy ud to Guide A Intractability: and Computers mr .Math. J. Amer. .Lno ah Soc. Math. London J. ur.J ueAp.Math. Appl. Pure J. Quart. 15) 277–283. (1955), 2 B 7(99,332–370. (1979), 27 (B) hpe .Itouto oGraphs to Introduction 1. Chapter 17) 239–246. (1974), 9 17) 30–32. (1873), 6 3(94,363–369. (1934), 13 4(92,225–236. (1922), 44 ulAe.Mt.Soc. Math. Amer. Bull .I Hochschulscripten I. B. cdmcPes 1973. Press, Academic , ah Ann. Math. imn 1977. Pitman, , mr .Math. J. Amer. caMt.Sinica Math. Acta 0(95,26–30. (1935), 10 IMJ Appl. J. SIAM 8(1891), 38 4(1890), 24 Canad. Trans.

72 69 ,

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i MK2 .MKy oeo h itr ftefu-oorconjecture, four-colour the of history the on note A McKay, orientables, B. closes [McK12] surfaces les sur régions voisines problème des Le Mayer, J. [Ma69] configuration, and Isomerism Senior, K. J. and Lunn C. A. [LuSe29] Lucas, E. [Lu:1882] Theory, Matching Plummer, D. M. Lovász Complexe, and räumliche L. [LoPl86] Census Der Listing, B. J. [Li:1861–2] Topologie, zur Vorstudien Listing, B. J. [Li:1847] théorème fondamental d’un immédiate Démonstration Schmoys Lhuilier, B. S.-A.-J. D. [Lh:1811] and Kan, Legendre, Rinooy A.-M. G. [Le:1794] H. A. Lenstra, K. J. Lawler, L. E. [LLRS85] topologie, traveling en the gauches courbes and problème des le graph Sur a Kuratowski, of K. subtree [Ku30] spanning shortest the On Kruskal, B. J. [Kr56] polyedra, König, of [Kö16] D. representation the On Kirkman, P. colours, T. four [Ki:1856] of problem geographical the On Kempe, B. A. [Ke:1879] in 85–103 problems, combinatorial among Reducibility Karp, M. formula, R. color [Ka72] Heawood the on note A Kagno, N. I. [Ka35] Toft, B. and Jensen R. T. Konigsberg?, [JeTo95] about truth The Wilson, R. and Hopkins B. [HoWi04] Theory Graph of History 1.3. Section Optimization (eds.), 271–283. (1930), 15 problem, salesman Mengenlehre, London 193–200. (1879), 2 1972. Computations Computer of 228–231. 198-207. (2004), 35 Theory Theory Combin. J. 1027–1079. (1929), matics Cl. Göttingen Math. 811–875. (1847), susceptible, 1 théorème Abh. est Naturwiss. ce dont exceptions Pétersb. et St. polyhèdres, Sci. Imp. les Mém. Acad. sur d’Euler h rvln aemnPolm uddTu hog Combinatorial through Tour Guided A Problem: Salesman Traveling The 9 ot-oln,1986. North-Holland, 29, 2(03,361–363. (2013), 72 4 15) 413–418. (1856), 146 catr”—21/14—1:5—pg 9—#49 — 49 page — 13:35 — 2013/11/4 — “chapter1” ie,1985. Wiley, , brGahnudir nedn u eemnnetereund Determinantentheorie auf Anwendung ihre und Graphen Uber ah Ann. Math. ¨ Récréations Mathématiques rc mr ah Soc. Math. Amer. Proc. 16) 177–195. (1969), 6 0(812,97–182. (1861–2), 10 le et eGéométrieEléments de 7(96,453–465. (1916), 77 e.R .Mle n .W hthr,Peu Press, Plenum Thatcher), W. J. and Miller E. R. (ed. rp ooigProblems Coloring Graph 11) 271–301. (1811), 4 o.1 atirVlas ai (1882). Paris Gauthier-Villars, 1, Vol. , 15) 48–50. (1956), 7 1te.,Fri io,Prs 1794. Paris, Didot, Firmin ed.), (1st Göttingen Studien naso iceeMathe- Discrete of Annals ie–nesine 1995. Wiley–Interscience, , .Mt.Phys. Math. J. hl rn.Ry Soc. Roy. Trans. Phil. b.K e.Wiss. Ges. K. Abh. .Py.Chem. Phys. J. olg ah J. Math. College mr .Math. J. Amer. At )Math. 1) (Abt. ud Math. Fund. Complexity 4(1935), 14 .Graph J.

49 33

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i S4]C .Sann hoe nclrn h ie fanetwork, a of lines the coloring on theorem A Shannon, Königs- E. Euler’s C. note: historical [Sh49] An Wilson, J. R. and Stiebitz M. Sachs, H. [SaStWi88] Ball, Rouse W. W. four-colour [Ro:1892] The Thomas, R. and Seymour, P. Sanders, D. Robertson, N. in survey, [RoSaSeTh97] a — minors Graph Seymour, D. P. and prob- Robertson map-coloring N. Heawood the [RoSe85] of Solution Youngs, T. W. J. and Ringel G. [RiYo68] Ringel, G. [Ri74] dés d’un 28 les desquelles combinaisons de nombre du Evaluation Reiss, M. distributions, [Re:1871–3] group-reduced of theory The Redfield, H. J. digraphs, [Re27] and graphs self-complementary of number the On Read, C. R. [Re63] über Permutationen, Satzes eines Beweis Prüfer, Neuer H. [Pr18] Read, C. Pólya R. [PóRe87] G. and und Graphen für Gruppen, Anzahlbestimmungen Pólya, Kombinatorische [Pó37] G. polyèdres, les et polygones les Sur Poinsot, L. [Po:1809–10] théorème le Tait, Sur de Petersen, J. [Pe:1898] regulären Graphs, der Theorie Die Petersen, J. [Pe:1891] traveling symmetric 532-city a of Optimization Rinaldi, G. and Padberg W. M. trees, [PaRi87] of number The Otter, R. circuits, [Ot48] Hamiltonian on Note Ore, O. [Or60] 50 S:878 .J yvse,Ceityadalgebra, and Chemistry Sylvester, J. J. [Sy:1877–8] 18) abig nvriyPes 153–171. Press, University Cambridge (1985), 1985 Combinatorics lem, jeu, 63–120. ce règle (1871–3), de d’après la 5 susceptibles (2) sont domino du jeu 433–455. (1927), Soc. Math. don 142–144. (1918), 27 (3) Compounds Chemical Verbindungen, chemische 16–48. 10), (Cah. 10) 220. cut, and branch by problem salesman 14) 148–151. (1949), letters, berg 1892. London, Times Present theorem, rc a.Aa.Si U.S.A. Sci. Acad. Nat. Proc. catr”—21/14—1:5—pg 0—#50 — 50 page — 13:35 — 2013/11/4 — “chapter1” .Cmi.Ter,Sr B Ser. Theory, Combin. J. .GahTheory Graph J. a oo Theorem Color Map ltrentitled (later 8(93,99–104. (1963), 38 e.I nesn,Lno ah o.LcueNtsSre 103 Series Notes Lecture Soc. Math. London Anderson), I. (ed. pigr 1987. Springer, , caMath. Acta ahmtclRcetosadPolm fPs and Past of Problems and Recreations Mathematical ahmtclRcetosadEssays and Recreations Mathematical 2(98,133–139. (1988), 12 obntra nmrto fGop,Gah and Graphs Groups, of Enumeration Combinatorial pigr 1974. Springer, , n.o Math. of Ann. 0(98,438–445. (1968), 60 0(97,2–44. (1997), 70 8(97,145–254. (1937), 68 pr e.Lett. Res. Oper. mr ah Monthly Math. Amer. Interméd. Math. hpe .Itouto oGraphs to Introduction 1. Chapter Nature 9(98,583–599. (1948), 49 caMath. Acta .EoePolytech. Ecole J. 7(878,284. (1877–8), 17 18) 1–7. (1987), 6 n.Mt ua Appl. Pura. Mat. Ann. 19) 225–227. (1898), 5 mr .Math. J. Amer. rh ah Phys. Math. Arch. .Mt.Phys. Math. J. 7(90,55. (1960), 67 5(81,193– (1891), 15 ,Macmillan, ), uvy in Surveys (1809– 4

.Lon- J.

28 49

i i i i i i

i Downloaded By: 10.3.98.104 At: 19:55 25 Sep 2021; For: 9781439880197, chapter1_3, 10.1201/b16132-3 i W9]R .Wlo,GahTer,Catr1 in 17 Wilson, R. Chapter [Wi02] Theory, Graph Wilson, J. R. dependence, [Wi99] linear of properties abstract the On Whitney, H. [Wh35] graphs, planar and Non-separable Whitney, H. [Wh31] Wernicke, multigraph, a P. [We:1904] of class chromatic The Vizing, G. p-graph, V. a of [Vi65] class chromatic the of estimate an On Vizing, G. V. [Vi64] Veblen, O. [Ve22] situation, problèmes de les sur Remarques Vandermonde, A.-T. [Va:1771] ratio, golden the and polynomials chromatic On Tutte, T. W. [Tu70] graphs, and Matroids Tutte, T. W. [Tu59] graphs, linear of factorizations The Tutte, T. W. [Tu47] circuits, hamiltonian On Tutte, T. W. [Tu46] einseit- Kartenfärbens auf des Problem über das Bemerkungen Einige Tietze, H. [Ti10] maps, of colouring the on Remarks Tait, graphical G. P. the [Ta:1878–80] to theory atomic new the of application an On Sylvester, J. J. [Sy:1878] Theory Graph of History 1.3. Section 10) 413–426. (1904), 9–17. 25–30. (1964), 3 (Paris) Sci. 289–296. (1970), 9 107–111. Flächen,igen 729. (1878–80), 10 quantics, binary 64–125. of (1878), covariants 1 and invariants the of representation 2002. 1999. Science, Elsevier James), M. I. 509–533. (1935), 57 125–127. (1931), 17) 556–574. (1771), catr”—21/14—1:5—pg 1—#51 — 51 page — 13:35 — 2013/11/4 — “chapter1” nlssSitus Analysis arse.Du.Math.-Ver. Deut. Jahresber. orClr Suffice Colors Four brdnkrorpice Vierfarbensatz, kartographischen den Uber ¨ mr ah o.Clo.Lc.11,NwYr,1922. York, New 1916, Lect. Colloq. Soc. Math. Amer. , le ae 02 rneo nvriyPress, University Princeton 2002; Lane, Allen , rn.Ae.Mt.Soc. Math. Amer. Trans. .Lno ah Soc. Math. London J. 9(90,155–179. (1910), 19 .Lno ah Soc. Math. London J. rc a.Aa.Si U.S.A. Sci. Acad. Nat. Proc. itr fTopology of History rc o.Sc Edinburgh Soc. Roy. Proc. ike.Analiz Diskret. 0(99,527–552. (1959), 90 .Cmi.Theory Combin. J. 1(96,98–101. (1946), 21 ah Ann. Math. mr .Math. J. Amer. mr .Math. J. Amer. ike.Analiz Diskret. Mém. Acad. 2(1947), 22 (1965), 5

(editor,

51 17 58

i i i i