Graph Theory In Memory Of G A Dirac


Download Graph Theory In Memory Of G A Dirac PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Graph Theory In Memory Of G A Dirac book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.

Download

Graph Theory in Memory of G.A. Dirac


Graph Theory in Memory of G.A. Dirac

Author: L. Døvling Andersen

language: en

Publisher: Elsevier

Release Date: 1988-12-01


DOWNLOAD





This volume is a tribute to the life and mathematical work of G.A. Dirac (1925-1984). One of the leading graph theorists, he developed methods of great originality and made many fundamental discoveries.The forty-two papers are all concerned with (or related to) Dirac's main lines of research. A number of mathematicians pay tribute to his memory by presenting new results in different areas of graph theory. Among the topics included are paths and cycles, hamiltonian graphs, vertex colouring and critical graphs, graphs and surfaces, edge-colouring, and infinite graphs.Some of the papers were originally presented at a meeting held in Denmark in 1985. Attendance being by invitation only, some 55 mathematicians from 14 countries participated in various lectures and discussions on graph theory related to the work of Dirac. This volume contains contributions from others as well, so should not be regarded only as the proceedings of that meeting. A problems section is included, as well as a listing of Dirac's own publications.

Annals of Discrete Mathematics


Annals of Discrete Mathematics

Author:

language: en

Publisher:

Release Date: 1977


DOWNLOAD





Handbook of Combinatorics Volume 1


Handbook of Combinatorics Volume 1

Author: Ronald L. Graham

language: en

Publisher: Elsevier

Release Date: 1995-12-11


DOWNLOAD





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.