Elzbieta Sidorowicz

Orcid: 0000-0002-7774-0512

According to our database1, Elzbieta Sidorowicz authored at least 43 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Hypergraph operations preserving sc-greediness.
Discuss. Math. Graph Theory, 2024

2023
(Strong) Proper vertex connection of some digraphs.
Appl. Math. Comput., December, 2023

Neighbour sum distinguishing edge-weightings with local constraints.
Discret. Appl. Math., September, 2023

2022
The neighbour sum distinguishing edge-weighting with local constraints.
CoRR, 2022

Sum-list-colouring of θ-hypergraphs.
Ars Math. Contemp., 2022

The neighbour sum distinguishing relaxed edge colouring.
Appl. Math. Comput., 2022

2021
Preface 2019.
Discuss. Math. Graph Theory, 2021

Proper connection and proper-walk connection of digraphs.
Appl. Math. Comput., 2021

2020
Equitable improper choosability of graphs.
Theor. Comput. Sci., 2020

Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common.
Discuss. Math. Graph Theory, 2020

Graph classes generated by Mycielskians.
Discuss. Math. Graph Theory, 2020

Independent (k+1)-domination in k-trees.
Discret. Appl. Math., 2020

Equitable d-degenerate Choosability of Graphs.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2018
Dynamic F-free Coloring of Graphs.
Graphs Comb., 2018

<i>P</i>-apex graphs.
Discuss. Math. Graph Theory, 2018

Rainbow connections in digraphs.
Discret. Appl. Math., 2018

Strong rainbow connection in digraphs.
Discret. Appl. Math., 2018

2017
Preface.
Discuss. Math. Graph Theory, 2017

The neighbour-sum-distinguishing edge-colouring game.
Discret. Math., 2017

2015
The Relaxed Game Chromatic Number of Graphs with Cut-Vertices.
Graphs Comb., 2015

Acyclic colourings of graphs with bounded degree.
CoRR, 2015

2014
A feedback vertex set of 2-degenerate graphs.
Theor. Comput. Sci., 2014

On the Relaxed Colouring Game and the Unilateral Colouring Game.
Graphs Comb., 2014

Global security in claw-free cubic graphs.
Discret. Appl. Math., 2014

Rainbow connection in oriented graphs.
Discret. Appl. Math., 2014

2013
Preface.
Discuss. Math. Graph Theory, 2013

On the non-(<i>p-1</i>)-partite <i>K<sub>p</sub></i>-free graphs.
Discuss. Math. Graph Theory, 2013

2012
Dynamic Coloring of Graphs.
Fundam. Informaticae, 2012

2011
Preface.
Discuss. Math. Graph Theory, 2011

2010
Acyclic colourings of graphs with bounded degree.
Discret. Math. Theor. Comput. Sci., 2010

Colouring game and generalized colouring game on graphs with cut-vertices.
Discuss. Math. Graph Theory, 2010

2009
Preface of guest editors.
Discuss. Math. Graph Theory, 2009

2007
The game chromatic number and the game colouring number of cactuses.
Inf. Process. Lett., 2007

Size of weakly saturated graphs.
Discret. Math., 2007

Generalised game colouring of graphs.
Discret. Math., 2007

Game List Colouring of Graphs.
Electron. J. Comb., 2007

2006
Marking Games.
Electron. Notes Discret. Math., 2006

Extremal bipartite graphs with a unique k-factor.
Discuss. Math. Graph Theory, 2006

2005
Ramsey (K<sub>1,2</sub>,K<sub>3</sub>)-Minimal Graphs.
Electron. J. Comb., 2005

2004
On Ramsey minimal graphs.
Discret. Math., 2004

2002
Weakly <i>P</i>-saturated graphs.
Discuss. Math. Graph Theory, 2002

Some extremal problems of graphs with local constraints.
Discret. Math., 2002

1997
Generalized domination, independence and irredudance in graphs.
Discuss. Math. Graph Theory, 1997


  Loading...