default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEwa Drgas-Burchardt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j40]Marta Borowiecka-Olszewska
, Ewa Drgas-Burchardt, Rita Zuazua:
On interval colouring reorientation number of oriented graphs. Discret. Appl. Math. 360: 65-80 (2025)- 2024
- [j39]Marta Borowiecka-Olszewska, Ewa Drgas-Burchardt:
Interval colourable orientations of graphs. Discret. Math. 347(11): 114143 (2024) - [j38]Piotr Borowiecki, Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Hypergraph operations preserving sc-greediness. Discuss. Math. Graph Theory 44(3): 1217 (2024) - 2022
- [j37]Ewa Drgas-Burchardt, Agata Drzystek, Elzbieta Sidorowicz:
Sum-list-colouring of θ-hypergraphs. Ars Math. Contemp. 22(1): 1 (2022) - 2021
- [j36]Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Preface 2019. Discuss. Math. Graph Theory 41(3): 695-695 (2021) - 2020
- [j35]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) - [j34]Mieczyslaw Borowiecki, Piotr Borowiecki, Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Graph classes generated by Mycielskians. Discuss. Math. Graph Theory 40(4): 1163-1173 (2020) - [j33]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
- 2019
- [j32]Ewa Drgas-Burchardt, Agata Drzystek:
Improper sum-list colouring of 2-trees. Discret. Appl. Math. 267: 73-84 (2019) - 2018
- [j31]Mieczyslaw Borowiecki, Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
P-apex graphs. Discuss. Math. Graph Theory 38(2): 323-349 (2018) - 2017
- [j30]Ewa Drgas-Burchardt, Katarzyna Gibek:
Harmonious colourings of graphs. Discret. Appl. Math. 217: 175-184 (2017) - [j29]Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Preface. Discuss. Math. Graph Theory 37(2): 299-299 (2017) - [j28]Marta Borowiecka-Olszewska, Ewa Drgas-Burchardt:
Forbidden structures for planar perfect consecutively colourable graphs. Discuss. Math. Graph Theory 37(2): 315-336 (2017) - 2016
- [j27]Marta Borowiecka-Olszewska, Ewa Drgas-Burchardt, Mariusz Haluszczak:
On the structure and deficiency of k-trees with bounded degree. Discret. Appl. Math. 201: 24-37 (2016) - [j26]Ewa Drgas-Burchardt, Kamila Kowalska, Jerzy Michael, Zsolt Tuza:
Some properties of vertex-oblique graphs. Discret. Math. 339(1): 95-102 (2016) - [j25]Marta Borowiecka-Olszewska, Ewa Drgas-Burchardt:
The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class. Discret. Math. 339(7): 1892-1908 (2016) - 2015
- [j24]Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Preface. Discuss. Math. Graph Theory 35(2): 313-314 (2015) - 2014
- [j23]Ewa Drgas-Burchardt:
Forbidden graphs for classes of split-like graphs. Eur. J. Comb. 39: 68-79 (2014) - [j22]Mieczyslaw Borowiecki, Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
A feedback vertex set of 2-degenerate graphs. Theor. Comput. Sci. 557: 50-58 (2014) - 2013
- [j21]Ewa Drgas-Burchardt, Zbigniew Switalski:
A number of stable matchings in models of the Gale-Shapley type. Discret. Appl. Math. 161(18): 2932-2936 (2013) - [j20]Ewa Drgas-Burchardt, Mariusz Haluszczak, Maria Kwasnik, Danuta Michalak, Elzbieta Sidorowicz:
Preface. Discuss. Math. Graph Theory 33(1): 5-6 (2013) - [j19]Ewa Drgas-Burchardt:
A note on the uniqueness of stable marriage matching. Discuss. Math. Graph Theory 33(1): 49-55 (2013) - [j18]Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Preface. Discuss. Math. Graph Theory 33(3): 475- (2013) - 2012
- [j17]Mieczyslaw Borowiecki, Ewa Drgas-Burchardt:
Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs. Discret. Math. 312(14): 2146-2152 (2012) - 2011
- [j16]Piotr Borowiecki, Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Preface. Discuss. Math. Graph Theory 31(2): 207 (2011) - [j15]Ewa Drgas-Burchardt:
On prime inductive classes of graphs. Eur. J. Comb. 32(8): 1317-1328 (2011) - 2010
- [j14]Ewa Drgas-Burchardt, Mariusz Haluszczak, Peter Mihók:
Minimal forbidden graphs of reducible additive hereditary graph properties. Ars Comb. 95 (2010)
2000 – 2009
- 2009
- [j13]Ewa Drgas-Burchardt:
On 3-chromatically unique and 3-chromatically equivalent hypergraphs. Ars Comb. 93 (2009) - [j12]Ewa Drgas-Burchardt:
Cardinality of a minimal forbidden graph family for reducible additive hereditary graph properties. Discuss. Math. Graph Theory 29(2): 263-274 (2009) - [j11]Ewa Drgas-Burchardt:
On uniqueness of a general factorization of graph properties. J. Graph Theory 62(1): 48-64 (2009) - 2007
- [j10]Ewa Drgas-Burchardt, Ewa Lazuka:
Chromatic polynomials of hypergraphs. Appl. Math. Lett. 20(12): 1250-1254 (2007) - [j9]Ewa Drgas-Burchardt, Anna Fiedorowicz:
Cost colourings of hypergraphs. Discret. Math. 307(11-12): 1298-1305 (2007) - 2006
- [j8]Ewa Drgas-Burchardt:
Joins of additive hereditary graph properties. Discuss. Math. Graph Theory 26(3): 413-418 (2006) - [j7]Ewa Drgas-Burchardt:
On k-chromatically unique and k-chromatically equivalent hypergraphs. Electron. Notes Discret. Math. 24: 57-60 (2006) - [j6]Ewa Drgas-Burchardt, Ewa Lazuka:
On chromatic polynomials of hypergraphs. Electron. Notes Discret. Math. 24: 105-110 (2006) - 2005
- [j5]Ewa Drgas-Burchardt, Anna Fiedorowicz:
Maximal Hypergraphs with Respect to the Bounded Cost Hereditary Property. Discuss. Math. Graph Theory 25(1-2): 67-77 (2005) - 2004
- [j4]Marta Borowiecka-Olszewska, Ewa Drgas-Burchardt, Peter Mihók:
Minimal vertex Ramsey graphs and minimal forbidden subgraphs. Discret. Math. 286(1-2): 31-36 (2004)
1990 – 1999
- 1995
- [j3]Mieczyslaw Borowiecki, Ewa Drgas-Burchardt, Peter Mihók:
Generalized list colourings of graphs. Discuss. Math. Graph Theory 15(2): 185-193 (1995) - 1993
- [j2]Mieczyslaw Borowiecki, Ewa Drgas-Burchardt:
Classes of chromatically unique graphs. Discret. Math. 111(1-3): 71-75 (1993) - [j1]Mieczyslaw Borowiecki, Ewa Drgas-Burchardt:
Classes of chromatically unique or equivalent graphs. Discret. Math. 121(1-3): 11-18 (1993)
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-21 00:24 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:
