Vertex labellings of simple graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15410%2F15%3A33156979" target="_blank" >RIV/61989592:15410/15:33156979 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Vertex labellings of simple graphs
Original language description
By the book 'Vertex labellings of simple graphs' culminated a seven-year effort of the authors to examine the vertex labellings of graphs via a new method of so-called chessboard representation suggested by the first author 20 years ago. It is due to this uniform method of study that the results are published in the form of a research monograph. The book introduced new concepts of a 'graph chessboard' and of a 'labelling relation' as useful tools for studying vertex labellings of graphs and for a possible tackling of the famous 'Graceful Tree Conjecture' from 1963, known also as 'Ringel-Kotzig-Rosa Conjecture'. The monograph brings many new results in the area of vertex labellings of graphs, improvements of known results or new approaches to known results. The visualization via the graph chessboard and the graph processor developed and provided by the second author can make this topic accessible also to researchers starting in this exceptionally dynamically developed area of mathematic
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)