Snark Graph Theory

Snark Graph Theory

Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken

     

бумажная книга



Издательство: Книга по требованию
Дата выхода: июль 2011
ISBN: 978-6-1309-6881-6
Объём: 64 страниц
Масса: 117 г
Размеры(В x Ш x Т), см: 23 x 16 x 1

High Quality Content by WIKIPEDIA articles! P. G. Tait initiated the study of snarks in 1880, when he proved that the four color theorem is equivalent to the statement that no snark is planar.The first known snark was the Petersen graph, discovered in 1898. In 1946, Croatian mathematician Danilo Blanusa discovered two more snarks, both on 18 vertices, now named the Blanusa snarks.The fourth known snark was found two years later by Bill Tutte, under the pseudonym Blanche Descartes, and was a graph of order 210.In 1973, George Szekeres found the fifth known snark — the Szekeres snark.In 1975, Isaacs generalized Blanusa's method to construct infinite families of snarks : the flower snark and the BDS snark, a family that includes the Blanusa snarks, the Descartes snark and the Szekeres snark BDS stands for Blanusa Descartes Szekeres.Isaacs also discovered a 30-vertices snark that does not belong to the BDS family and that is not a flower snark: the double-star snark. Snarks were so named by the American mathematician Martin Gardner in 1976, after the mysterious and elusive object of the poem The Hunting of the Snark by Lewis Carroll.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.

Каталог