Wyszukiwarka
Nie znaleźliśmy wyników w zadanych kryteriach!
Ale mamy wyniki w innych katalogach.Filtry
wszystkich: 3142
-
Katalog
- Publikacje 2355 wyników po odfiltrowaniu
- Czasopisma 16 wyników po odfiltrowaniu
- Konferencje 6 wyników po odfiltrowaniu
- Osoby 40 wyników po odfiltrowaniu
- Laboratoria 1 wyników po odfiltrowaniu
- Kursy Online 24 wyników po odfiltrowaniu
- Wydarzenia 2 wyników po odfiltrowaniu
- Dane Badawcze 698 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: game chromatic number
-
T-colorings, divisibility and circular chromatic number
PublikacjaLet T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 ≤ t ≤ d (max T + 1): d |t ⇒ t/d ∈ T} . We show that espd⊙T (G) = d espT (G) − r, where r, 0 ≤ r ≤ d − 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙{0} (G) =...
-
Infinite chromatic games
PublikacjaIn the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic...
-
2-Coloring number revisited
Publikacja2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...
-
Anna Zielińska dr
OsobyOd 2016 r. rozpoczęła pracę na Wydziale Zarządzania i Ekonomii Politechniki Gdańskiej. Od 2018 r. członek rady International Project Management Association Young Crew Polska. Autorka licznych publikacji naukowych zakresu zarządzania antykryzysowego, zarządzania projektami i programami zdrowotnymi oraz doskonalenia podmiotów gospodarczych. Zainteresowania naukowo-badawcze obejmują zarządzanie programami i projektami, nowoczesne...
-
Liczby Ramseya on-line dla różnych klas grafów
PublikacjaRozpatrujemy grę rozgrywaną na nieskończonej liczbie wierzchołków, w której każda runda polega na wskazaniu krawędzi przez jednego gracza - Budowniczego oraz pokolorowaniu jej przez drugiego gracza - Malarkę na jeden z dwóch kolorów, czerwony lub niebieski. Celem Budowniczego jest zmuszenie Malarki do stworzenia monochromatycznej kopii wcześniej ustalonego grafu H w jak najmniejszej możliwej liczbie ruchów. Zakładamy, że gracze...
-
Total chromatic sum for trees
PublikacjaThe total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
-
Game about space or game in the space?
PublikacjaThe article analyzes various aspects of the actions taken by participants involved in the process of a spatial change. Such a process is described as a game about space or a game in the space. Different terminology is presented, in particular the meaning of: spatial order, regional studies, eco-development, sustainable development. Different forms of the game are analyzed: space as a theater, as a casino, as an area of conflict....
-
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublikacjaWe consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...
-
Integration of brood units in game universe
PublikacjaAn access to a great number of various services allows for decomposition of complex problems Developing a game universe usually involves creation of various units which can be encountered by a player. Those can be lonely or organized in broods animals and monsters wandering around the game world. In order to provide natural gaming experience those units should behave variously depending on the world situation. Those behaviours...
-
Relations between the domination parameters and the chromatic index of a graph
PublikacjaIn this paper we show bounds for the sum and the product of the domination parameters and the chromatic index of a graph. We alsopresent some families of graphs for which these bounds are achieved.