scispace - formally typeset
Open AccessBook

Graph Theory

Reads0
Chats0
TLDR
Gaph Teory Fourth Edition is standard textbook of modern graph theory which covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each chapter by one or two deeper results.
Abstract
Gaph Teory Fourth Edition Th is standard textbook of modern graph theory, now in its fourth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each fi eld by one or two deeper results, again with proofs given in full detail.

read more

Citations
More filters
Book ChapterDOI

Balanced allocation and dictionaries with tightly packed constant size bins

TL;DR: It is shown that e> (2/e)d−−1 is sufficient to guarantee that with high probability each ball can be put into one of the two bins assigned to it, without any bin overflowing.
Journal ArticleDOI

Topological Conditions for Uniqueness of Equilibrium in Networks

TL;DR: This paper shows that in a two-terminal network, the equilibrium costs are always unique if and only if the network is one of several simple networks or consists of several such networks connected in series.
Book

Manipulating Quantum Structures Using Laser Pulses

TL;DR: In this article, the Schrodinger equation is used to model the Schroffinger equation of the weak pulse in a two-state coherent excitation model and the vector model is used.
Journal ArticleDOI

Homomorphisms of Signed Graphs

TL;DR: In this article, it was shown that Hadwiger's conjecture only holds for small chromatic numbers and that the largest planar signed clique is of order 8, whereas for the maximum chromatic number of signed graphs, the upper bound is shown to be 10.

Logic, Graphs, and Algorithms

TL;DR: Algorithmic meta theorems as mentioned in this paper are results that apply to whole families of combinatorial problems, instead of just specific problems, and are usually defined in terms of logic and graph theory.
Related Papers (5)