default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElzbieta Sidorowicz
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j42]Piotr Borowiecki
, Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Hypergraph operations preserving sc-greediness. Discuss. Math. Graph Theory 44(3): 1217 (2024)- 2023
- [j41]Kairui Nie, Yingbin Ma, Elzbieta Sidorowicz:
(Strong) Proper vertex connection of some digraphs. Appl. Math. Comput. 458: 128243 (2023) - [j40]Antoine Dailly, Elzbieta Sidorowicz:
Neighbour sum distinguishing edge-weightings with local constraints. Discret. Appl. Math. 336: 109-124 (2023) - 2022
- [j39]Antoine Dailly, Éric Duchêne, Aline Parreau, Elzbieta Sidorowicz:
The neighbour sum distinguishing relaxed edge colouring. Appl. Math. Comput. 419: 126864 (2022) - [j38]Ewa Drgas-Burchardt, Agata Drzystek, Elzbieta Sidorowicz:
Sum-list-colouring of θ-hypergraphs. Ars Math. Contemp. 22(1): 1 (2022) - [i2]Antoine Dailly, Elzbieta Sidorowicz:
The neighbour sum distinguishing edge-weighting with local constraints. CoRR abs/2203.11521 (2022) - 2021
- [j37]Anna Fiedorowicz, Elzbieta Sidorowicz, Éric Sopena:
Proper connection and proper-walk connection of digraphs. Appl. Math. Comput. 410: 126253 (2021) - [j36]Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Preface 2019. Discuss. Math. Graph Theory 41(3): 695-695 (2021) - 2020
- [j35]Mieczyslaw Borowiecki, Anna Fiedorowicz, Elzbieta Sidorowicz, Zsolt Tuza:
Independent (k+1)-domination in k-trees. Discret. Appl. Math. 284: 99-110 (2020) - [j34]Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common. Discuss. Math. Graph Theory 40(3): 893-917 (2020) - [j33]Mieczyslaw Borowiecki, Piotr Borowiecki, Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Graph classes generated by Mycielskians. Discuss. Math. Graph Theory 40(4): 1163-1173 (2020) - [j32]Ewa Drgas-Burchardt, Hanna Furmanczyk, Elzbieta Sidorowicz:
Equitable improper choosability of graphs. Theor. Comput. Sci. 844: 34-45 (2020) - [c1]Ewa Drgas-Burchardt, Hanna Furmanczyk, Elzbieta Sidorowicz:
Equitable d-degenerate Choosability of Graphs. IWOCA 2020: 251-263
2010 – 2019
- 2018
- [j31]Elzbieta Sidorowicz, Éric Sopena:
Strong rainbow connection in digraphs. Discret. Appl. Math. 238: 133-143 (2018) - [j30]Elzbieta Sidorowicz, Éric Sopena:
Rainbow connections in digraphs. Discret. Appl. Math. 243: 248-261 (2018) - [j29]Mieczyslaw Borowiecki, Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
P-apex graphs. Discuss. Math. Graph Theory 38(2): 323-349 (2018) - [j28]Piotr Borowiecki, Elzbieta Sidorowicz:
Dynamic F-free Coloring of Graphs. Graphs Comb. 34(3): 457-475 (2018) - 2017
- [j27]Olivier Baudon, Jakub Przybylo, Mohammed Senhaji, Elzbieta Sidorowicz, Éric Sopena, Mariusz Wozniak:
The neighbour-sum-distinguishing edge-colouring game. Discret. Math. 340(7): 1564-1572 (2017) - [j26]Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Preface. Discuss. Math. Graph Theory 37(2): 299-299 (2017) - 2015
- [j25]Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Preface. Discuss. Math. Graph Theory 35(2): 313-314 (2015) - [j24]Elzbieta Sidorowicz:
The Relaxed Game Chromatic Number of Graphs with Cut-Vertices. Graphs Comb. 31(6): 2381-2400 (2015) - [i1]Anna Fiedorowicz, Elzbieta Sidorowicz:
Acyclic colourings of graphs with bounded degree. CoRR abs/1511.04207 (2015) - 2014
- [j23]Katarzyna Jesse-Józefczyk, Elzbieta Sidorowicz:
Global security in claw-free cubic graphs. Discret. Appl. Math. 175: 11-23 (2014) - [j22]Paul Dorbec, Ingo Schiermeyer, Elzbieta Sidorowicz, Éric Sopena:
Rainbow connection in oriented graphs. Discret. Appl. Math. 179: 69-78 (2014) - [j21]Elzbieta Sidorowicz:
On the Relaxed Colouring Game and the Unilateral Colouring Game. Graphs Comb. 30(4): 1013-1036 (2014) - [j20]Mieczyslaw Borowiecki, Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
A feedback vertex set of 2-degenerate graphs. Theor. Comput. Sci. 557: 50-58 (2014) - 2013
- [j19]Ewa Drgas-Burchardt, Mariusz Haluszczak, Maria Kwasnik, Danuta Michalak, Elzbieta Sidorowicz:
Preface. Discuss. Math. Graph Theory 33(1): 5-6 (2013) - [j18]Kinnari Amin, Jill R. Faudree, Ronald J. Gould, Elzbieta Sidorowicz:
On the non-(p-1)-partite Kp-free graphs. Discuss. Math. Graph Theory 33(1): 9-23 (2013) - [j17]Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Preface. Discuss. Math. Graph Theory 33(3): 475- (2013) - 2012
- [j16]Piotr Borowiecki, Elzbieta Sidorowicz:
Dynamic Coloring of Graphs. Fundam. Informaticae 114(2): 105-128 (2012) - 2011
- [j15]Piotr Borowiecki, Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Preface. Discuss. Math. Graph Theory 31(2): 207 (2011) - 2010
- [j14]Elzbieta Sidorowicz:
Colouring game and generalized colouring game on graphs with cut-vertices. Discuss. Math. Graph Theory 30(3): 499-533 (2010) - [j13]Mieczyslaw Borowiecki, Anna Fiedorowicz, Katarzyna Jesse-Józefczyk, Elzbieta Sidorowicz:
Acyclic colourings of graphs with bounded degree. Discret. Math. Theor. Comput. Sci. 12(1): 59-74 (2010)
2000 – 2009
- 2009
- [j12]Piotr Borowiecki, Danuta Michalak, Elzbieta Sidorowicz:
Preface of guest editors. Discuss. Math. Graph Theory 29(2): 207 (2009) - 2007
- [j11]Mieczyslaw Borowiecki, Elzbieta Sidorowicz, Zsolt Tuza:
Game List Colouring of Graphs. Electron. J. Comb. 14(1) (2007) - [j10]Mieczyslaw Borowiecki, Elzbieta Sidorowicz:
Generalised game colouring of graphs. Discret. Math. 307(11-12): 1225-1231 (2007) - [j9]Elzbieta Sidorowicz:
Size of weakly saturated graphs. Discret. Math. 307(11-12): 1486-1492 (2007) - [j8]Elzbieta Sidorowicz:
The game chromatic number and the game colouring number of cactuses. Inf. Process. Lett. 102(4): 147-151 (2007) - 2006
- [j7]Arne Hoffmann, Elzbieta Sidorowicz, Lutz Volkmann:
Extremal bipartite graphs with a unique k-factor. Discuss. Math. Graph Theory 26(2): 181-192 (2006) - [j6]Elzbieta Sidorowicz:
Marking Games. Electron. Notes Discret. Math. 24: 211-214 (2006) - 2005
- [j5]Mieczyslaw Borowiecki, Ingo Schiermeyer, Elzbieta Sidorowicz:
Ramsey (K1,2,K3)-Minimal Graphs. Electron. J. Comb. 12 (2005) - 2004
- [j4]Mieczyslaw Borowiecki, Mariusz Haluszczak, Elzbieta Sidorowicz:
On Ramsey minimal graphs. Discret. Math. 286(1-2): 37-43 (2004) - 2002
- [j3]Mieczyslaw Borowiecki, Elzbieta Sidorowicz:
Some extremal problems of graphs with local constraints. Discret. Math. 251(1-3): 19-32 (2002) - [j2]Mieczyslaw Borowiecki, Elzbieta Sidorowicz:
Weakly P-saturated graphs. Discuss. Math. Graph Theory 22(1): 17-29 (2002)
1990 – 1999
- 1997
- [j1]Mieczyslaw Borowiecki, Danuta Michalak, Elzbieta Sidorowicz:
Generalized domination, independence and irredudance in graphs. Discuss. Math. Graph Theory 17(1): 147-153 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
