Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Eulerian Graphs and Related Topics

Eulerian graph theory --- Eulerian graph theory. --- Algebra --- Mathematics --- Physical Sciences & Mathematics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Covering Walks  in Graphs is aimed at researchers and graduate students in the graph theory community and provides a comprehensive treatment on measures of two well studied graphical properties, namely Hamiltonicity and traversability in graphs. This text looks into the famous Kӧnigsberg Bridge Problem, the Chinese Postman Problem, the Icosian Game and the Traveling Salesman Problem as well as well-known mathematicians who were involved in these problems. The concepts of different spanning walks with examples and present classical results on Hamiltonian numbers and upper Hamiltonian numbers of graphs are described; in some cases, the authors provide proofs of these results to illustrate the beauty and complexity of this area of research. Two new concepts of traceable numbers of graphs and traceable numbers of vertices of a graph which were inspired by and closely related to Hamiltonian numbers are introduced. Results are illustrated on these two concepts and the relationship between traceable concepts and Hamiltonian concepts are examined. Describes several variations of traceable numbers, which provide new frame works for several well-known Hamiltonian concepts and produce interesting new results.

Eulerian graph theory. --- Graph theory. --- Hamiltonian graph theory. --- Graph theory --- Mathematics --- Physical Sciences & Mathematics --- Algebra --- Graphs, Hamiltonian --- Hamiltonian graphs --- Eulerian graphs --- Graphs, Eulerian --- Graphs, Theory of --- Theory of graphs --- Extremal problems --- Mathematics. --- Applied mathematics. --- Engineering mathematics. --- Combinatorics. --- Graph Theory. --- Applications of Mathematics. --- Combinatorial analysis --- Topology --- Math --- Science --- Combinatorics --- Mathematical analysis --- Engineering --- Engineering analysis

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Graph theory goes back several centuries and revolves around the study of graphs-mathematical structures showing relations between objects. With applications in biology, computer science, transportation science, and other areas, graph theory encompasses some of the most beautiful formulas in mathematics-and some of its most famous problems. The Fascinating World of Graph Theory explores the questions and puzzles that have been studied, and often solved, through graph theory. This book looks at graph theory's development and the vibrant individuals responsible for the field's growth. Introducing fundamental concepts, the authors explore a diverse plethora of classic problems such as the Lights Out Puzzle, and each chapter contains math exercises for readers to savor. An eye-opening journey into the world of graphs, The Fascinating World of Graph Theory offers exciting problem-solving possibilities for mathematics and beyond.

Graph theory. --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Extremal problems --- 1-Factorization Conjecture. --- 1-factorable graph. --- 2-factorable graph. --- Alfred Bray Kempe. --- Alspach's Conjecture. --- Around the World Problem. --- Art Gallery Problem. --- Arthur Cayley. --- Brick-Factory Problem. --- Cayley's Tree Formula. --- Chinese Postman Problem. --- Christian Goldbach. --- Erdős number. --- Euler Identity. --- Euler Polyhedron Formula. --- Eulerian graph. --- First Theorem of Graph Theory. --- Five Color Theorem. --- Five Queens Problem. --- Four Color Conjecture. --- Four Color Problem. --- Gottfried Leibniz. --- Graceful Tree Conjecture. --- Hall's Theorem. --- Hamiltonian graph. --- Herbert Ellis Robbins. --- Icosian Game. --- Instant Insanity. --- Internet. --- Job-Hunters Problem. --- King Chicken Theorem. --- Kirkman's Schoolgirl Problem. --- Knight's Tour Puzzle. --- Kruskal's Algorithm. --- Kuratowski's Theorem. --- Königsberg Bridge Problem. --- Leonhard Euler. --- Lights Out Puzzle. --- Marriage Theorem. --- Minimum Spanning Tree Problem. --- Paul Erdős. --- Peter Guthrie Tait. --- Petersen graph. --- Petersen's Theorem. --- Pierre Fermat. --- Polyhedron Problem. --- Problem of the Five Princes. --- Prüfer code. --- Ramsey number. --- Reconstruction Problem. --- Road Coloring Theorem. --- Robbins's Theorem. --- Sir William Rowan Hamilton. --- Steiner triple system. --- Thomas Penyngton Kirkman. --- Three Friends or Three Strangers Problem. --- Three Houses and Three Utilities Problem. --- Traveling Salesman Problem. --- Traveller's Dodecahedron. --- Tutte's Theorem. --- Vizing's Theorem. --- Voyage Round the World. --- Wagner's Conjecture. --- What Is Mathematics?. --- William Tutte. --- bipartite graph. --- bridge. --- chromatic index. --- coloring. --- complete graph. --- complex numbers. --- connected graph. --- crossing number. --- cyclic decomposition. --- decision tree. --- distance. --- dominating set. --- edge coloring. --- geometry of position. --- graceful graph. --- graph theory. --- graph. --- icosian calculus. --- irregular graph. --- irregular multigraph. --- isomorphic graph. --- leaf. --- mathematicians. --- mathematics. --- orientation. --- oriented graph. --- planar graph. --- problem solving. --- regular graph. --- round robin tournament. --- subgraph. --- theorem. --- tree. --- vertex coloring. --- voting. --- weighted graph.