Book Description
The purpose of this book is to present selected results on perfect graphs in a single volume. These take the form of reprinted classical papers, survey papers or new results.
Author : V. Chvátal
Publisher : Elsevier
Page : 385 pages
File Size : 28,52 MB
Release : 1984-11-01
Category : Mathematics
ISBN : 0080871992
The purpose of this book is to present selected results on perfect graphs in a single volume. These take the form of reprinted classical papers, survey papers or new results.
Author : Andreas Brandstadt
Publisher : SIAM
Page : 315 pages
File Size : 10,54 MB
Release : 1999-01-01
Category : Mathematics
ISBN : 9780898719796
This well-organized reference is a definitive encyclopedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each. The authors state results without proof, providing readers with easy access to far more key theorems than are commonly found in other mathematical texts. Interconnections between graph classes are also provided to make the book useful to a variety of readers.
Author : Vadim Zverovich
Publisher : Cambridge Scholars Publishing
Page : 309 pages
File Size : 43,32 MB
Release : 2019-06-24
Category : Mathematics
ISBN : 1527536289
This book considers a number of research topics in graph theory and its applications, including ideas devoted to alpha-discrepancy, strongly perfect graphs, reconstruction conjectures, graph invariants, hereditary classes of graphs, and embedding graphs on topological surfaces. It also discusses applications of graph theory, such as transport networks and hazard assessments based on unified networks. The book is ideal for developers of grant proposals and researchers interested in exploring new areas of graph theory and its applications.
Author : Lowell W. Beineke
Publisher : Cambridge University Press
Page : 416 pages
File Size : 44,63 MB
Release : 2015-05-07
Category : Mathematics
ISBN : 1316239853
Chromatic graph theory is a thriving area that uses various ideas of 'colouring' (of vertices, edges, and so on) to explore aspects of graph theory. It has links with other areas of mathematics, including topology, algebra and geometry, and is increasingly used in such areas as computer networks, where colouring algorithms form an important feature. While other books cover portions of the material, no other title has such a wide scope as this one, in which acknowledged international experts in the field provide a broad survey of the subject. All fifteen chapters have been carefully edited, with uniform notation and terminology applied throughout. Bjarne Toft (Odense, Denmark), widely recognized for his substantial contributions to the area, acted as academic consultant. The book serves as a valuable reference for researchers and graduate students in graph theory and combinatorics and as a useful introduction to the topic for mathematicians in related fields.
Author : N.V.R. Mahadev
Publisher : Elsevier
Page : 559 pages
File Size : 24,1 MB
Release : 1995-09-13
Category : Mathematics
ISBN : 0080543006
Threshold graphs have a beautiful structure and possess many important mathematical properties. They have applications in many areas including computer science and psychology. Over the last 20 years the interest in threshold graphs has increased significantly, and the subject continues to attract much attention.The book contains many open problems and research ideas which will appeal to graduate students and researchers interested in graph theory. But above all Threshold Graphs and Related Topics provides a valuable source of information for all those working in this field.
Author : Bruce A. Reed
Publisher : Springer Science & Business Media
Page : 357 pages
File Size : 22,54 MB
Release : 2006-05-17
Category : Mathematics
ISBN : 0387224440
Excellent authors, such as Lovasz, one of the five best combinatorialists in the world; Thematic linking that makes it a coherent collection; Will appeal to a variety of communities, such as mathematics, computer science and operations research
Author : Martin Charles Golumbic
Publisher : Elsevier
Page : 307 pages
File Size : 33,83 MB
Release : 2014-05-10
Category : Mathematics
ISBN : 1483271978
Algorithmic Graph Theory and Perfect Graphs provides an introduction to graph theory through practical problems. This book presents the mathematical and algorithmic properties of special classes of perfect graphs. Organized into 12 chapters, this book begins with an overview of the graph theoretic notions and the algorithmic design. This text then examines the complexity analysis of computer algorithm and explains the differences between computability and computational complexity. Other chapters consider the parameters and properties of a perfect graph and explore the class of perfect graphs known as comparability graph or transitively orientable graphs. This book discusses as well the two characterizations of triangulated graphs, one algorithmic and the other graph theoretic. The final chapter deals with the method of performing Gaussian elimination on a sparse matrix wherein an arbitrary choice of pivots may result in the filling of some zero positions with nonzeros. This book is a valuable resource for mathematicians and computer scientists.
Author : Lowell W. Beineke
Publisher : Cambridge University Press
Page : 400 pages
File Size : 22,80 MB
Release : 2021-06-03
Category : Mathematics
ISBN : 1108671071
Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developments on graph algorithms and related concepts that will be of value to both mathematicians and computer scientists, at a level suitable for graduate students, researchers and instructors. The fifteen expository chapters, written by acknowledged international experts on their subjects, focus on the application of algorithms to solve particular problems. All chapters were carefully edited to enhance readability and standardize the chapter structure as well as the terminology and notation. The editors provide basic background material in graph theory, and a chapter written by the book's Academic Consultant, Martin Charles Golumbic (University of Haifa, Israel), provides background material on algorithms as connected with graph theory.
Author : Oscar Levin
Publisher : Createspace Independent Publishing Platform
Page : 342 pages
File Size : 10,38 MB
Release : 2016-08-16
Category :
ISBN : 9781534970748
This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the "introduction to proof" course for math majors. The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this. Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs. The book contains over 360 exercises, including 230 with solutions and 130 more involved problems suitable for homework. There are also Investigate! activities throughout the text to support active, inquiry based learning. While there are many fine discrete math textbooks available, this text has the following advantages: It is written to be used in an inquiry rich course. It is written to be used in a course for future math teachers. It is open source, with low cost print editions and free electronic editions.
Author : Adrian Bondy
Publisher : Springer Science & Business Media
Page : 387 pages
File Size : 29,83 MB
Release : 2006-12-22
Category : Mathematics
ISBN : 3764374004
In July 2004, a conference on graph theory was held in Paris in memory of Claude Berge, one of the pioneers of the field. The event brought together many prominent specialists on topics such as perfect graphs and matching theory, upon which Claude Berge's work has had a major impact. This volume includes contributions to these and other topics from many of the participants.