Wyszukiwarka
Wyniki wyszukiwania dla: GRAPH COLOURING
Znaleźliśmy mało wyników, wypróbuj alternatywnej metody wyszukiwania.
Filtry
wszystkich: 2
wybranych: 1
Filtry wybranego katalogu
Wyniki wyszukiwania dla: GRAPH COLOURING
-
Parity vertex colouring of graphs
PublikacjaA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...