𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the coloured graph structure of Lusztig's canonical basis

✍ Scribed by Markus Reineke

Publisher
Springer
Year
1997
Tongue
English
Weight
273 KB
Volume
307
Category
Article
ISSN
0025-5831

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the structure of graphs with few P4s
On the structure of graphs with few P4s
✍ Luitpold Babel; Stephan Olariu πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 984 KB

We present new classes of graphs for which the isomorphism problem can be solved in polynomial time. These graphs are characterized by containing -in some local sense -only a small number of induced paths of length three. As it turns out, every such graph has a unique tree representation: the intern

A list version of Dirac's theorem on the
A list version of Dirac's theorem on the number of edges in colour-critical graphs
✍ Alexandr V. Kostochka; Michael Stiebitz πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 110 KB πŸ‘ 2 views

## Abstract One of the basic results in graph colouring is Brooks' theorem [R. L. Brooks, Proc Cambridge Phil Soc 37 (1941) 194–197], which asserts that the chromatic number of every connected graph, that is not a complete graph or an odd cycle, does not exceed its maximum degree. As an extension o