Author : D. de Werra
Publisher : Elsevier
Page : 269 pages
File Size : 31,55 MB
Release : 1989-01-01
Category : Mathematics
ISBN : 0080867790
Graph Colouring and Variations
Author : Lowell W. Beineke
Publisher : Cambridge University Press
Page : 416 pages
File Size : 21,46 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 : Tommy R. Jensen
Publisher : John Wiley & Sons
Page : 320 pages
File Size : 44,29 MB
Release : 2011-10-24
Category : Mathematics
ISBN : 1118030745
Contains a wealth of information previously scattered in research journals, conference proceedings and technical reports. Identifies more than 200 unsolved problems. Every problem is stated in a self-contained, extremely accessible format, followed by comments on its history, related results and literature. The book will stimulate research and help avoid efforts on solving already settled problems. Each chapter concludes with a comprehensive list of references which will lead readers to original sources, important contributions and other surveys.
Author : Crina Grosan
Publisher : Springer
Page : 410 pages
File Size : 47,43 MB
Release : 2007-08-29
Category : Computers
ISBN : 3540732977
This edited volume is targeted at presenting the latest state-of-the-art methodologies in "Hybrid Evolutionary Algorithms". The chapters deal with the theoretical and methodological aspects, as well as various applications to many real world problems from science, technology, business or commerce. Overall, the book has 14 chapters including an introductory chapter giving the fundamental definitions and some important research challenges. The contributions were selected on the basis of fundamental ideas/concepts rather than the thoroughness of techniques deployed.
Author : Michael Molloy
Publisher : Springer Science & Business Media
Page : 320 pages
File Size : 27,73 MB
Release : 2013-06-29
Category : Mathematics
ISBN : 3642040160
Over the past decade, many major advances have been made in the field of graph coloring via the probabilistic method. This monograph, by two of the best on the topic, provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality.
Author :
Publisher : Academic Press
Page : 277 pages
File Size : 12,84 MB
Release : 2011-08-29
Category : Mathematics
ISBN : 0080873391
The Four-Color Problem
Author : Ding-Zhu Du
Publisher : Springer Science & Business Media
Page : 395 pages
File Size : 13,66 MB
Release : 2006-08-18
Category : Business & Economics
ISBN : 0387238301
This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set. It can also be regarded as a stand-alone volume presenting chapters dealing with various aspects of the subject in a self-contained way.
Author : Edward R. Scheinerman
Publisher : Courier Corporation
Page : 242 pages
File Size : 10,81 MB
Release : 2013-04-29
Category : Mathematics
ISBN : 0486292134
This volume explains the general theory of hypergraphs and presents in-depth coverage of fundamental and advanced topics: fractional matching, fractional coloring, fractional edge coloring, fractional arboricity via matroid methods, fractional isomorphism, and more. 1997 edition.
Author : Pierre Hansen
Publisher : American Mathematical Soc.
Page : 168 pages
File Size : 38,82 MB
Release : 1999
Category : Mathematics
ISBN : 9780821819555
This volume presents the proceedings of the CRM workshop on graph coloring and applications. The articles span a wide spectrum of topics related to graph coloring, including: list-colorings, total colorings, colorings and embeddings of graphs, chromatic polynomials, characteristic polynomials, chromatic scheduling, and graph coloring problems related to frequency assignment. Outstanding researchers in combinatorial optimization and graph theory contributed their work. A list of open problems is included.
Author : Ronald L. Graham
Publisher : Elsevier
Page : 1124 pages
File Size : 21,37 MB
Release : 1995-12-11
Category : Business & Economics
ISBN : 9780444823465
Handbook of Combinatorics, Volume 1 focuses on basic methods, paradigms, results, issues, and trends across the broad spectrum of combinatorics. The selection first elaborates on the basic graph theory, connectivity and network flows, and matchings and extensions. Discussions focus on stable sets and claw free graphs, nonbipartite matching, multicommodity flows and disjoint paths, minimum cost circulations and flows, special proof techniques for paths and circuits, and Hamilton paths and circuits in digraphs. The manuscript then examines coloring, stable sets, and perfect graphs and embeddings and minors. The book takes a look at random graphs, hypergraphs, partially ordered sets, and matroids. Topics include geometric lattices, structural properties, linear extensions and correlation, dimension and posets of bounded degree, hypergraphs and set systems, stability, transversals, and matchings, and phase transition. The manuscript also reviews the combinatorial number theory, point lattices, convex polytopes and related complexes, and extremal problems in combinatorial geometry. The selection is a valuable reference for researchers interested in combinatorics.
