The Fascinating World of Graph Theory (eBook)

Fascinating World of Graph Theory

Arthur Benjamin, Gary Chartrand, Ping Zhang (Autoren)

eBook Download: PDF | EPUB

2015 | 1. Auflage
344 Seiten
Princeton University Press (Verlag)
978-1-4008-5200-0 (ISBN)

Infos

Arthur Benjamin is professor of mathematics at Harvey Mudd College. Gary Chartrand is professor emeritus of mathematics at Western Michigan University. Ping Zhang is professor of mathematics at Western Michigan University.

Produkt-Details

• Erscheint lt. Verlag: 18.1.2015
• Zusatzinfo: 300 line illus.
• Verlagsort: Princeton
• Sprache: englisch
• Themenwelt: Sachbuch/Ratgeber ► Natur / Technik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika
• Themenwelt: Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Graphentheorie
• Themenwelt: Mathematik / Informatik ► Mathematik ► Mathematische Spiele und Unterhaltung
• Schlagworte: 1-factorable graph • 1-Factorization Conjecture • 2-factorable graph • abstract algebra • Addition • Additive identity • Alfred Bray Kempe • Alspach's Conjecture • Around the World Problem • art gallery problem • Arthur Cayley • Augustus De Morgan • Big O notation • binary tree • bipartite graph • Brick-Factory Problem • Bridge • Cayley's Tree Formula • Chemical formula • chessboard • Chinese postman problem • Christian Goldbach • chromatic index • Claude Berge • Collaboration graph • Coloring • complete bipartite graph • complete graph • complex numbers • conjecture • connected graph • Connectivity (graph theory) • Contradiction • Counting • crossing number • Crossing number (graph theory) • Cubic graph • Cycle graph • cyclic decomposition • Decision Tree • Degree (graph theory) • diagonal • Diagram (category theory) • directed graph • Distance • dodecahedron • dominating set • edge coloring • Embedding • empty set • Erdős number • Eulerian graph • Eulerian path • Euler Identity • Euler Polyhedron Formula • Euler's identity • existential quantification • Fermat number • Finite set • First Theorem of Graph Theory • Five Color Theorem • Five Queens Problem • Four Color Conjecture • Four Color Problem • Four Color Theorem • Geometry • geometry of position • Gottfried Leibniz • graceful graph • Graceful tree conjecture • Graph • Graph (abstract data type) • graph coloring • Graph Drawing • graph minor • graph theory • Gratitude • Hall's Theorem • Hamiltonian graph • Hamiltonian path • Handshaking lemma • Herbert Ellis Robbins • hydrogen atom • Hypercube • icosian calculus • Icosian Game • Instant Insanity • Integer • Internet • irregular graph • irregular multigraph • isomorphic graph • Job-Hunters Problem • Julius Petersen • just in case • Kenneth Appel • King Chicken Theorem • Kirkman's Schoolgirl Problem • Knight's Tour Puzzle • Königsberg Bridge Problem • Kruskal's Algorithm • Kuratowski's Theorem • leaf • Leonhard Euler • Lewis Carroll • Lights Out Puzzle • Line (geometry) • Line segment • London Mathematical Society • Marriage Theorem • Matching (graph theory) • Mathematical problem • Mathematical Proof • mathematician • Mathematicians • Mathematics • Message in a Bottle • minimum spanning tree • Minimum Spanning Tree Problem • Molecule • Multigraph • Natural number • octahedron • orientation • oriented graph • Parity (mathematics) • Path graph • Paul Erdős • peter guthrie tait • Petersen graph • Petersen's Theorem • Pierre Fermat • planar graph • planarity • Platonic solid • polyhedron • Polyhedron Problem • Problem of the Five Princes • Problem Solving • Prüfer code • Pythagorean triple • quaternion • Ramsey Number • Ramsey's theorem • Reconstruction Problem • rectangle • Regular Graph • result • Road Coloring Theorem • Robbins's Theorem • round robin tournament • Sir William Rowan Hamilton • small number • Steiner triple system • subgraph • Subset • Summation • tetrahedron • Textbook • Theorem • Thomas Penyngton Kirkman • Three Friends or Three Strangers Problem • Three Houses and Three Utilities Problem • Three utilities problem • Topology • Traveling Salesman Problem • Traveller's Dodecahedron • Tree • Tutte's Theorem • vertex coloring • Vertex (graph theory) • Vizing's Theorem • Voting • Voyage Round the World • Wagner's Conjecture • Wagner's theorem • weighted graph • What Is Mathematics? • William Rowan Hamilton • William Tutte
• ISBN-10: 1-4008-5200-5 / 1400852005
• ISBN-13: 978-1-4008-5200-0 / 9781400852000