๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some Topological Methods in Graph Coloring Theory

โœ Scribed by Bojan Mohar

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
230 KB
Volume
5
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

โœฆ Synopsis

Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology to graph coloring problems will be presented. In particular, the following subjects will be treated: The use of Euler's formula and local planarity conditions, Kempe equivalence, homotopy, winding number and its higher dimensional analogues.

๐Ÿ“œ SIMILAR VOLUMES

Some problems in topological graph theor
Some problems in topological graph theory
โœ Jonathan L. Gross; Frank Harary ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 504 KB

## Abstract A list of 31 problems presented here reflects some of the main trends in topological graph theory.

Strategies for interconnection networks:
Strategies for interconnection networks: Some methods from graph theory
โœ J.-C. Bermond; C. Delorme; J.-J. Quisquater ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 909 KB

Interconnection networks require dense graphs in the sense that many nodes with relatively few links may be connected with relatively short paths. Some recent constructions of such dense graphs with a given maximal degree A and diameter D (known as (A, D) graphs) are reviewed here. The paper also co

Hopf algebra methods in graph theory
Hopf algebra methods in graph theory
โœ William R. Schmitt ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 790 KB