книги Наука, техника, медицина Естественные науки Точные науки Математика Научные издания Теория вероятностей

Chromatic Polynomials and Chromaticity of Graphs and Hypergraphs. Chromaticity of Jahnagir Graph: h-Chromaticity of Linear Uniform Hypercycles: Cyclomatic Number of Hypergraphs

Код 917220

Нет в продаже

Аннотация к книге "Chromatic Polynomials and Chromaticity of Graphs and Hypergraphs. Chromaticity of Jahnagir Graph: h-Chromaticity of Linear Uniform Hypercycles: Cyclomatic Number of Hypergraphs"

For a century, one of the most famous problems in mathematics was to prove the Four-colour theorem. In a paper Birkhof proposed a way of tackling the four-colour problem by introducing a function P(M,?), to be the number of proper colourings of a map M. It turns out that P(M,?) is a polynomial in ?, called the chromatic polynomial of M. In 1968, Read asked: What is the necessary and sufficient condition for two graphs to be chromatically equivalent; i.e. to have same chromatic polynomial? A...

Оставить комментарий

Оцените книгу:

Издательство: Книга по требованию
Дата выхода: июль 2011
ISBN: 978-3-6392-5612-3
Объём: 76 страниц
Масса: 135 г
Размеры(высота, ширина, толщина), см: 23 x 16 x 1

Вместе с этой книгой покупают