Zobrazeno 1 - 10
of 164
pro vyhledávání: '"Nowak, Malgorzata"'
Autor:
Dębski, Michał, Grytczuk, Jarosław, Pawlik, Bartłomiej, Przybyło, Jakub, Śleszyńska-Nowak, Małgorzata
A \emph{tangram} is a word in which every letter occurs an even number of times. Such word can be cut into parts that can be arranged into two identical words. The minimum number of cuts needed is called the \emph{cut number} of a tangram. For exampl
Externí odkaz:
http://arxiv.org/abs/2407.03819
We study a new variant of \emph{connected coloring} of graphs based on the concept of \emph{strong} edge coloring (every color class forms an \emph{induced} matching). In particular, an edge-colored path is \emph{strongly proper} if its color sequenc
Externí odkaz:
http://arxiv.org/abs/2301.10578
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bosek, Bartłomiej, Gordinowicz, Przemysław, Grytczuk, Jarosław, Nisse, Nicolas, Sokół, Joanna, Śleszyńska-Nowak, Małgorzata
Publikováno v:
Electronic Journal of Combinatorics, 25 (2018), #P4.62, 19pp
One important problem in a network is to locate an (invisible) moving entity by using distance-detectors placed at strategical locations. For instance, the metric dimension of a graph $G$ is the minimum number $k$ of detectors placed in some vertices
Externí odkaz:
http://arxiv.org/abs/1711.08836
Publikováno v:
In European Journal of Combinatorics May 2022 102
Autor:
Bosek, Bartłomiej, Gordinowicz, Przemysław, Grytczuk, Jarosław, Nisse, Nicolas, Sokół, Joanna, Śleszyńska-Nowak, Małgorzata
Publikováno v:
Discrete Applied Mathematics, 251 (2018), 30-39
The main topic of this paper is motivated by a localization problem in cellular networks. Given a graph $G$ we want to localize a walking agent by checking his distance to as few vertices as possible. The model we introduce is based on a pursuit grap
Externí odkaz:
http://arxiv.org/abs/1709.05904
Autor:
BORKOWSKA-NOWAK, MAŁGORZATA
Publikováno v:
Roczniki Filozoficzne / Annales de Philosophie / Annals of Philosophy, 2021 Jan 01. 69(2), 329-346.
Externí odkaz:
https://www.jstor.org/stable/27031733
Autor:
Kowalski, Łukasz, Kaczmarek, Maciej, Krzyszowski, Andrzej, Kowalski, Andrzej Piotr, Garbacz-Klempka, Aldona, Szczepaniak, Małgorzata, Ścibior, Dominik, Gaweł, Adam, Targowski, Piotr, Ćwikliński, Łukasz, Szczepańska, Grażyna, Wardas-Lasoń, Marta, Wrzesińska, Anna, Perek-Nowak, Małgorzata, Długosz, Piotr
Publikováno v:
In Journal of Archaeological Science: Reports August 2021 38
Autor:
Śleszyńska-Nowak, Małgorzata
An \emph{edge coloring} of a graph $G$ is strong if each color class is an induced matching of $G$. The \emph{strong chromatic index} of $G$, denoted by $\chi _{s}^{\prime }(G)$, is the minimum number of colors for which $G$ has a strong edge colorin
Externí odkaz:
http://arxiv.org/abs/1504.06585
Publikováno v:
In Polymer Testing October 2020 90