Yap H.P. — Total Colourings of Graphs :: Электронная библиотека попечительского совета мехмата МГУ

Главная Ex Libris Книги Журналы Статьи Серии Каталог Wanted Загрузка ХудЛит Справка Поиск по индексам Поиск Форум

Авторизация

Поиск по указателям

Yap H.P. — Total Colourings of Graphs

Обсудите книгу на научном форуме

Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter

Название: Total Colourings of Graphs

Автор: Yap H.P.

Аннотация:

This book provides an up-to-date and rapid introduction to an important and currently active topic in graph theory. The author leads the reader to the forefront of research in this area. Complete and easily readable proofs of all the main theorems, together with numerous examples, exercises and open problems are given. The book is suitable for use as a textbook or as seminar material for advanced undergraduate and graduate students. The references are comprehensive and so it will also be useful for researchers as a handbook.

Язык:

Рубрика: Математика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1996

Количество страниц: 148

Добавлена в каталог: 05.07.2008

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

-vertex      97
-colourable      3
-colouring      3
-edge-colour able      3
-edge-colouring      3
-total-colourable      4
-vertex      32
1-Factor      2
2-alternating cycle      97
Adjacent      1
ARC      3
Balanced complete -partite graph      2
Balanced r-partite graph      2
Bermond's theorem      22
Biconformable colouring      13
Biconformable graph      13
Bipartite graph      2
Bipartition      2
Blocked      44
Chromatic index      3
Chromatic number      3
Circulant graph      3
Class 1 graph      8
Class 2 graph      8
Colour classes      3
Colour-vertex pair      84
Complement of a graph      2
Complete -partite graph      2
Complete graph      2
Conformable colouring      11
Conformable graph      11
Contraction at a vertex      102
Core of a graph      8
Cubic graph      2
Deficiency      11
Degree of a vertex      1
Density of a graph      118
Digraph      3
Dirac's theorem      46
Disjoint graphs      2
Edge independence number      2
Edge-colouring      3
Embeddable      3
Embedding      3
End-vertex      1
Enlarge - Matching Argument      37
Fail recolouring process      48
Fan      45
Generalized colouring      117
Generalized edge-coloruing      118
Generalized total-colouring      117
Hall's theorem      35
Hamilton cycle      2
Hamilton path      2
Hamiltonian      2
Hilton's conjecture      13
Idempotent latin square      85
incident      1
Independent edges      2

Independent set of vertices and edges      4
Independent vertices      2
Induced subgraph      1
Join of two graphs      2
K $\ddot{o}$ nig's theorem      88
Lower $K_{n}$       59
Major vertex      8
Matching      2
Maximal ( $\alpha$ , $\beta$ )-path      44
Maximal graph      36
Maximum degree      1
Minimum degree      1
Minor vertex      8
Multigraph      3
Multiplicity of an edge      3
Natural edge-colouring of $K_{n, n}$       17
Natural edge-colouring of $K_{n}$       15
Near perfect matching      2
Neighbour      1
Neighbourhood      1
Null graph      2
Order of a graph      1
Outerplanar graph      3
Overfull graph      119
Partial colouring      25
Partial edge-colouring      25
Partial total-colouring      25
Path      2
Perfect matching      2
Polar graph      12
Regular graph      2
Regular of degree d      2
Reverse of a path      44
Size of a graph      1
Specified vertex      28
Split ()-edge-colouring of $K_{2n}$       59
Star      2
Subgraph      1
Suitable total-set-colouring      48
Swoppable path      44
Symbol of a circulant graph      3
Symmetric latin square      85
Total chromatic critical      115
Total chromatic number      4
Total colouring      4
Total colouring conjecture      4
Total-independence number      10
Total-independence set      4
Total-set-colouring      45
Type 1 graph      8
Type 2 graph      8
Union of two graphs      3
Unswoppable path      44
Upper $K_{n}$       59
Usual vertex      32
Valency-list      36
Vertex-colouring      3
Vertex-independence number      2
Vizing's theorem      8
Weight of an edge      97

О проекте