Nacionalni portal odprte znanosti

We propose a new coloring game on a graph, called the independence coloring game, which is played by two players with opposite goals. The result of the game is a proper coloring of vertices of a graph G, and Alice’s goal is that as few colors as possible are used during the game, while Bob wants to ...

V magistrskem delu dokažemo Anderson-Choquetov izrek za enolične funkcije in tip Anderson-Choquetovega izreka za večlične funkcije. Natančno je predstavljena tudi njuna uporaba.

V doktorski disertaciji obravnavamo v zadnjih letih vpeljane variacije klasične igre barvanja in njim sorodne igre na grafih. Doktorsko delo sestoji iz štirih delov, znotraj katerih predstavimo nova spoznanja na omenjeno temo. V prvem delu disertacije obravnavamo indicirano igro barvanja kartezičnih ...

We study the Wiener index of a class of trees with fixed diameter and order. A double broom is a tree such that there exist two vertices u and v, such that each leaf of T is adjacent to u or v. We prove that for a tree T of diameter d and (sufficiently large) order n such that , T has maximum Wiener ...