Mathematical Proofs: A Transition to Advanced Mathematics, Third Edition, prepares students for the more abstract mathematics courses that follow calculus. Appropriate for self-study or for use in the classroom, this text introduces students to proof techniques, analyzing proofs, and writing proofs of their own. Written in a clear, conversational style, this book provides a solid introduction to such topics as relations, functions, and cardinalities of sets, as well as the theoretical aspects of fields such as number theory, abstract algebra, and group theory. It is also a great reference text that students can look back to when writing or reading proofs in their more advanced courses.

Now streamlined from previous editions, a new author team brings in a fresh look to this classic textbook and at how graph theory courses have evolved. When the first edition of this precursor text was published, there were few undergraduate courses offered. The text assisted in the establishment of the undergraduate course, while also offering enough coverage for a graduate course. Graph theory is not a seminal course in all combinatorics programs taught in universities and colleges throughout the world. This text has remained among the top three best-sellers. The book is famous for the quality of the writing and presentation. We have two best-sellers for his course, including Gross, etal.'s Graph Theory and Its Applications. This one-two punch in this course means we can go against any and all texts and compete successfully.

With Chromatic Graph Theory, Second Edition, the authors present various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. Readers will see that the authors accomplished the primary goal of this textbook, which is to introduce graph theory with a coloring theme and to look at graph colorings in various ways. The textbook also covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings. Features of the Second Edition: The book can be used for a first course in graph theory as well as a graduate course The primary topic in the book is graph coloring The book begins with an introduction to graph theory so assumes no previous course The authors are the most widely-published team on graph theory Many new examples and exercises enhance the new edition

Now streamlined from previous editions, a new author team brings in a fresh look to this classic textbook and at how graph theory courses have evolved. When the first edition of this precursor text was published, there were few undergraduate courses offered. The text assisted in the establishment of the undergraduate course, while also offering enough coverage for a graduate course. Graph theory is not a seminal course in all combinatorics programs taught in universities and colleges throughout the world. This text has remained among the top three best-sellers. The book is famous for the quality of the writing and presentation. We have two best-sellers for his course, including Gross, etal.'s Graph Theory and Its Applications. This one-two punch in this course means we can go against any and all texts and compete successfully.

With Chromatic Graph Theory, Second Edition, the authors present various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. Readers will see that the authors accomplished the primary goal of this textbook, which is to introduce graph theory with a coloring theme and to look at graph colorings in various ways. The textbook also covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings. Features of the Second Edition: The book can be used for a first course in graph theory as well as a graduate course The primary topic in the book is graph coloring The book begins with an introduction to graph theory so assumes no previous course The authors are the most widely-published team on graph theory Many new examples and exercises enhance the new edition

This comprehensive text offers undergraduates a remarkably student-friendly introduction to graph theory. Written by two of the field's most prominent experts, it takes an engaging approach that emphasizes graph theory's history. Unique examples and lucid proofs provide a sound yet accessible treatment that stimulates interest in an evolving subject and its many applications.
Optional sections designated as "excursion" and "exploration" present interesting sidelights of graph theory and touch upon topics that allow students the opportunity to experiment and use their imaginations. Three appendixes review important facts about sets and logic, equivalence relations and functions, and the methods of proof. The text concludes with solutions or hints for odd-numbered exercises, in addition to references, indexes, and a list of symbols.

Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics.

This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex colorings.

With historical, applied, and algorithmic discussions, this text offers a solid introduction to one of the most popular areas of graph theory.

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.

Die Theorie der regularen Graphen (The Theory of Regular Graphs), written by the Danish Mathematician Julius Petersen in 1891, is often considered the first strictly theoretical paper dealing with graphs. In the 130 years since then, regular graphs have been a common and popular area of study. While regular graphs are typically considered to be graphs whose vertices all have the same degree, a more general interpretation is that of graphs possessing some common characteristic throughout their structure. During the past several decades, however, there has been some increased interest in investigating graphs possessing a property that is, in a sense, opposite to regularity. It is this topic with which this book deals, giving rise to a study of what might be called irregularity in graphs. Here, various irregularity concepts dealing with several topics in graph theory are described, such as degrees of vertices, graph labelings, weightings, colorings, graph structures, Eulerian and Hamiltonian properties, graph decompositions, and Ramsey-type problems.

This book is in honor of the 80th birthday of Stephen Hedetniemi. It describes advanced material in graph theory in the areas of domination, coloring, spanning cycles and circuits, and distance that grew out of research topics investigated by Stephen Hedetniemi. The purpose of this book is to provide background and principal results on these topics, along with same related problems and conjectures, for researchers in these areas. The most important features deal with material, results, and problems that researchers may not be aware of but may find of interest. Each chapter contains results, methods and information that will give readers the necessary background to investigate each topic in more detail.

Clear, lively style covers all basics of theory and application, including Mathematical Models, Elementary Concepts of Graph Theory, Transportation Problems, Connection Problems, Party Problems, Diagraphs and Mathematical Models, Games and Puzzles, Graphs and Social Psychology, Planar Graphs and Coloring Problems, and Graphs and Other Mathematics.

Graphs & Digraphs masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, theorems, history, and applications of graph theory. Fully updated and thoughtfully reorganized to make reading and locating material easier for instructors and students, the Sixth Edition of this bestselling, classroom-tested text: Adds more than 160 new exercises Presents many new concepts, theorems, and examples Includes recent major contributions to long-standing conjectures such as the Hamiltonian Factorization Conjecture, 1-Factorization Conjecture, and Alspach's Conjecture on graph decompositions Supplies a proof of the perfect graph theorem Features a revised chapter on the probabilistic method in graph theory with many results integrated throughout the text At the end of the book are indices and lists of mathematicians' names, terms, symbols, and useful references. There is also a section giving hints and solutions to all odd-numbered exercises. A complete solutions manual is available with qualifying course adoption. Graphs & Digraphs, Sixth Edition remains the consummate text for an advanced undergraduate level or introductory graduate level course or two-semester sequence on graph theory, exploring the subject's fascinating history while covering a host of interesting problems and diverse applications.

This book depicts graph labelings that have led to thought-provoking problems and conjectures. Problems and conjectures in graceful labelings, harmonious labelings, prime labelings, additive labelings, and zonal labelings are introduced with fundamentals, examples, and illustrations. A new labeling with a connection to the four color theorem is described to aid mathematicians to initiate new methods and techniques to study classical coloring problems from a new perspective. Researchers and graduate students interested in graph labelings will find the concepts and problems featured in this book valuable for finding new areas of research.