Zobrazeno 1 - 10
of 124
pro vyhledávání: '"Boštjan Brešar"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 17 no. 1, Iss Graph Theory (2015)
Graph Theory
Externí odkaz:
https://doaj.org/article/f7c0074f02d6411aaeba1dc1b2961c77
Publikováno v:
Discrete Applied Mathematics. 317:124-135
Publikováno v:
Applied Mathematics and Computation. 450:128007
The orientable domination number, ${\rm DOM}(G)$, of a graph $G$ is the largest domination number over all orientations of $G$. In this paper, ${\rm DOM}$ is studied on different product graphs and related graph operations. The orientable domination
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e800d700f53972fbae092696a193bf2f
http://arxiv.org/abs/2211.02395
http://arxiv.org/abs/2211.02395
Publikováno v:
Journal of Graph Theory. 99:359-377
Autor:
Daša Štesl, Boštjan Brešar
Publikováno v:
Quaestiones mathematicae, vol. 45, no. 9, pp. 1413-1434, 2022.
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 po
Publikováno v:
Discrete Applied Mathematics. 298:143-154
Given a graph G and a non-decreasing sequence S = ( a 1 , a 2 , … ) of positive integers, the mapping f : V ( G ) → { 1 , … , k } is an S -packing k -coloring of G if for any distinct vertices u , v ∈ V ( G ) with f ( u ) = f ( v ) = i the di
Autor:
Boštjan Brešar, Simon Brezovnik
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 44:3637-3661
Given a finite graph G, the maximum length of a sequence $$(v_1,\ldots ,v_k)$$ of vertices in G such that each $$v_i$$ dominates a vertex that is not dominated by any vertex in $$\{v_1,\ldots ,v_{i-1}\}$$ is called the Grundy domination number, $$\ga
Publikováno v:
Discrete Applied Mathematics. 289:320-326
The indicated coloring game is played on a simple graph G by two players, with a fixed set C of colors. In each round of the game Ann indicates an uncolored vertex, and Ben colors it using a color from C , obeying just the proper coloring rule. The g
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 4, Pp 923-970 (2020)
If S = (a1, a2, . . .) is a non-decreasing sequence of positive integers, then an S-packing coloring of a graph G is a partition of V (G) into sets X1, X2, . . . such that for each pair of distinct vertices in the set Xi, the distance between them is