✦ LIBER ✦

On Haagerup’s List of Potential Principal Graphs of Subfactors

✍ Scribed by Marta Asaeda; Seidai Yasuda

Book ID: 105903179
Publisher: Springer
Year: 2008
Tongue: English
Weight: 357 KB
Volume: 286
Category: Article
ISSN: 0010-3616
DOI: 10.1007/s00220-008-0588-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Principal graphs of subfactors with smal

Principal graphs of subfactors with small Jones index

✍ Dietmar Bisch 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 126 KB

On list edge-colorings of subcubic graph

On list edge-colorings of subcubic graphs

✍ Martin Juvan; Bojan Mohar; Riste Sˇkrekovski 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 705 KB

On the list dynamic coloring of graphs

✍ S. Akbari; M. Ghanbari; S. Jahanbekam 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 317 KB

On List Coloring and List Homomorphism o

On List Coloring and List Homomorphism of Permutation and Interval Graphs

✍ Enright, Jessica; Stewart, Lorna; Tardos, Gábor 📂 Article 📅 2014 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 237 KB

A note on list-coloring powers of graphs

✍ Kosar, Nicholas; Petrickova, Sarka; Reiniger, Benjamin; Yeager, Elyse 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 401 KB

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