ESElżbieta Sidorowicz
Elżbieta Sidorowicz
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Elżbieta Sidorowicz has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
Ewa Drgas-Burchardt
11 shared publications- Anna Fiedorowicz
University of Zielona Góra
5 shared publications Mieczysław Borowiecki
5 shared publications- Piotr Borowiecki
Gdansk University of Technology
5 shared publications - Ewa Drgas-Burchardt
University of Zielona Góra
3 shared publications - Mieczysław Borowiecki
University of Zielona Góra
3 shared publications
Latest Publications
- 1 January 2024
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 44 (3) , 1217-1241
Hypergraph operations preserving sc-greediness
- 1 January 2024
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 44 (3) , 1217-1241
Hypergraph operations preserving sc-greediness
- Open Access
- 27 July 2023
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 458
(Strong) Proper vertex connection of some digraphs
- 27 July 2023
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 458
Open Access(Strong) Proper vertex connection of some digraphs
- 24 April 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 336, 109-124
Neighbour sum distinguishing edge-weightings with local constraints
- 24 April 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 336, 109-124
Neighbour sum distinguishing edge-weightings with local constraints
- Open Access
Neighbour sum distinguishing edge-weightings with local constraints
A $k$-edge-weighting of $G$ is a mapping $\omega:E(G)\longrightarrow \{1,\ldots,k\}$. The edge-weighting of $G$ naturally induces a vertex-colouring $\sigma_{\omega}:V(G)\longrightarrow \mathbb{N}$ given by$\sigma_{\omega}(v)=\sum_{u\in N_G(v)}\omega(vu)$ for every $v\in V(G)$. The edge-weighting $\omega$ is neighbour sum distinguishing if it yields a proper vertex-colouring $\sigma_{\omega}$, \emph{i.e.}, $\sigma_{\omega}(u)\neq \sigma_{\omega}(v)$ for every edge $uv$ of $G$.We investigate a neighbour sum distinguishing edge-weighting with local constraints, namely, we assume that the set of edges incident to a vertex of large degree is not monochromatic. A graph is nice if it has no components isomorphic to $K_2$. We prove that every nice graph with maximum degree at most~5 admits a neighbour sum distinguishing $(\Delta(G)+2)$-edge-weighting such that all the vertices of degree at least~2 are incident with at least two edges of different weights. Furthermore, we prove that every nice graph admits a neighbour sum distinguishing $7$-edge-weighting such that all the vertices of degree at least~6 are incident with at least two edges of different weights. Finally, we show that nice bipartite graphs admit a neighbour sum distinguishing $6$-edge-weighting such that all the vertices of degree at least~2 are incident with at least two edges of different weights.Open AccessNeighbour sum distinguishing edge-weightings with local constraints
A $k$-edge-weighting of $G$ is a mapping $\omega:E(G)\longrightarrow \{1,\ldots,k\}$. The edge-weighting of $G$ naturally induces a vertex-colouring $\sigma_{\omega}:V(G)\longrightarrow \mathbb{N}$ given by$\sigma_{\omega}(v)=\sum_{u\in N_G(v)}\omega(vu)$ for every $v\in V(G)$. The edge-weighting $\omega$ is neighbour sum distinguishing if it yields a proper vertex-colouring $\sigma_{\omega}$, \emph{i.e.}, $\sigma_{\omega}(u)\neq \sigma_{\omega}(v)$ for every edge $uv$ of $G$.We investigate a neighbour sum distinguishing edge-weighting with local constraints, namely, we assume that the set of edges incident to a vertex of large degree is not monochromatic. A graph is nice if it has no components isomorphic to $K_2$. We prove that every nice graph with maximum degree at most~5 admits a neighbour sum distinguishing $(\Delta(G)+2)$-edge-weighting such that all the vertices of degree at least~2 are incident with at least two edges of different weights. Furthermore, we prove that every nice graph admits a neighbour sum distinguishing $7$-edge-weighting such that all the vertices of degree at least~6 are incident with at least two edges of different weights. Finally, we show that nice bipartite graphs admit a neighbour sum distinguishing $6$-edge-weighting such that all the vertices of degree at least~2 are incident with at least two edges of different weights. - Open Access
- 1 April 2022
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 419, 126864
The neighbour sum distinguishing relaxed edge colouring
- 1 April 2022
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 419, 126864
Open AccessThe neighbour sum distinguishing relaxed edge colouring
- 21 February 2022
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 22 (1) , #P1.05
Sum-list-colouring of θ-hypergraphs
Sum-list-colouring of θ-hypergraphs
- 21 February 2022
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 22 (1) , #P1.05
Sum-list-colouring of θ-hypergraphs
Sum-list-colouring of θ-hypergraphs
- 1 December 2020
- Published by Elsevier in Theoretical Computer Science
- Vol. 844, 34-45
Equitable improper choosability of graphs
- 1 December 2020
- Published by Elsevier in Theoretical Computer Science
- Vol. 844, 34-45
Equitable improper choosability of graphs
- 1 September 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 284, 99-110
Independent -domination in -trees- 1 September 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 284, 99-110
Independent -domination in -trees- Open Access
- 29 May 2020
- Published by Springer Nature
- Vol. 12126, 251-263
Equitable d-degenerate Choosability of Graphs
Let \(\mathcal{D}_d\) be the class of d-degenerate graphs and let L be a list assignment for a graph G. A colouring of G such that every vertex receives a colour from its list and the subgraph induced by vertices coloured with one color is a d-degenerate graph is called the \((L,\mathcal{D}_d)\)-colouring of G. For a k-uniform list assignment L and \(d\in \mathbb {N}_0\), a graph G is equitably \((L,\mathcal{D}_d)\)-colorable if there is an \((L,\mathcal{D}_d)\)-colouring of G such that the size of any colour class does not exceed \(\left\lceil |V(G)|/k\right\rceil \). An equitable \((L,\mathcal{D}_d)\)-colouring is a generalization of an equitable list coloring, introduced by Kostochka et al., and an equitable list arboricity presented by Zhang. Such a model can be useful in the network decomposition where some structural properties on subnets are imposed. In this paper we give a polynomial-time algorithm that for a given (k, d)-partition of G with a t-uniform list assignment L and \(t\ge k\), returns its equitable \((L,\mathcal {D}_{d-1})\)-colouring. In addition, we show that 3-dimensional grids are equitably \((L,\mathcal {D}_1)\)-colorable for any t-uniform list assignment L where \(t\ge 3\).- 29 May 2020
- Published by Springer Nature
- Vol. 12126, 251-263
Open AccessEquitable d-degenerate Choosability of Graphs
Let \(\mathcal{D}_d\) be the class of d-degenerate graphs and let L be a list assignment for a graph G. A colouring of G such that every vertex receives a colour from its list and the subgraph induced by vertices coloured with one color is a d-degenerate graph is called the \((L,\mathcal{D}_d)\)-colouring of G. For a k-uniform list assignment L and \(d\in \mathbb {N}_0\), a graph G is equitably \((L,\mathcal{D}_d)\)-colorable if there is an \((L,\mathcal{D}_d)\)-colouring of G such that the size of any colour class does not exceed \(\left\lceil |V(G)|/k\right\rceil \). An equitable \((L,\mathcal{D}_d)\)-colouring is a generalization of an equitable list coloring, introduced by Kostochka et al., and an equitable list arboricity presented by Zhang. Such a model can be useful in the network decomposition where some structural properties on subnets are imposed. In this paper we give a polynomial-time algorithm that for a given (k, d)-partition of G with a t-uniform list assignment L and \(t\ge k\), returns its equitable \((L,\mathcal {D}_{d-1})\)-colouring. In addition, we show that 3-dimensional grids are equitably \((L,\mathcal {D}_1)\)-colorable for any t-uniform list assignment L where \(t\ge 3\). - Open Access
- 1 January 2020
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 40 (3) , 893-917
Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common
- 1 January 2020
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 40 (3) , 893-917
Open AccessSum-list colouring of unions of a hypercycle and a path with at most two vertices in common