On the Solvability of the Discrete s(x,·)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs

Autor: Filip Pietrusiak, Renata Wieteska, Przemysław Gordinowicz

Publikováno v: Entropy, Vol 24, Iss 10, p 1353 (2022)

We use the finite dimensional monotonicity methods in order to investigate problems connected with the discrete sx,·-Laplacian on simple, connected, undirected, weighted, and finite graphs with nonlinearities given in a non-potential form. Positive

Externí odkaz: https://doaj.org/article/d8e69e6076244e66bfbf4dce50bb4f31

On $n$-saturated closed graphs

Autor: Szymon Glab, Przemysław Gordinowicz

Geschke proved that there is clopen graph on $2^\omega$ which is 3-saturated, but the clopen graphs on $2^\omega$ do not even have infinite subgraphs that are 4-saturated; however there is $F_\sigma$ graph that is $\omega_1$-saturated. It turns out t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7966d3cfa6d50a3a28d890b429d231f5

The polynomial method for list-colouring extendability of outerplanar graphs

Autor: Przemysław Gordinowicz, Paweł Twardowski

Publikováno v: Ars Mathematica Contemporanea. 21:#P2.08

We restate theorems of Hutchinson [5] on list-colouring extendability for outerplanar graphs in terms of non-vanishing monomials in a graph polynomial , which yields an Alon-Tarsi equivalent for her work. This allows to simplify her proofs as well as

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac752f10b7b082e202fdf0df333ba392
https://doi.org/10.26493/1855-3974.2398.7d5

Centroidal localization game

Autor: Malgorzata Sleszynska-Nowak, Jarosław Grytczuk, Przemysław Gordinowicz, Bartłomiej Bosek, Joanna Sokół, Nicolas Nisse

Publikováno v: The Electronic Journal of Combinatorics
The Electronic Journal of Combinatorics, In press
The Electronic Journal of Combinatorics, Open Journal Systems, In press
Scopus-Elsevier

One important problem in a network $G$ is to locate an (invisible) moving entity by using distance-detectors placed at strategical locations in $G$. For instance, the famous metric dimension of a graph $G$ is the minimum number $k$ of detectors place

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0da6868204054d3e8ad370e1221c0db3

Cops and Robbers playing on edges

Autor: Paweł Prałat, Andrzej Dudek, Przemysław Gordinowicz

Publikováno v: Journal of Combinatorics. 5:131-153

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::9d18ea4eb82402fbf6532d62660040b5
https://doi.org/10.4310/joc.2014.v5.n1.a6