default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna Fiedorowicz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j14]Anna Fiedorowicz
, Elzbieta Sidorowicz, Éric Sopena:
Proper connection and proper-walk connection of digraphs. Appl. Math. Comput. 410: 126253 (2021)- 2020
- [j13]Mieczyslaw Borowiecki, Anna Fiedorowicz, Elzbieta Sidorowicz, Zsolt Tuza:
Independent (k+1)-domination in k-trees. Discret. Appl. Math. 284: 99-110 (2020)
2010 – 2019
- 2015
- [i1]Anna Fiedorowicz, Elzbieta Sidorowicz:
Acyclic colourings of graphs with bounded degree. CoRR abs/1511.04207 (2015) - 2013
- [j12]Anna Fiedorowicz:
Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree. Discuss. Math. Graph Theory 33(1): 91-99 (2013) - 2012
- [j11]Anna Fiedorowicz:
Acyclic edge colouring of plane graphs. Discret. Appl. Math. 160(10-11): 1513-1523 (2012) - [j10]Mieczyslaw Borowiecki, Anna Fiedorowicz:
Q-Ramsey classes of graphs. Discret. Math. 312(23): 3437-3443 (2012) - [j9]Anna Fiedorowicz, Mariusz Haluszczak:
Acyclic chromatic indices of fully subdivided graphs. Inf. Process. Lett. 112(13): 557-561 (2012) - 2011
- [j8]Anna Fiedorowicz:
Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices. Inf. Process. Lett. 111(6): 287-290 (2011) - 2010
- [j7]Mieczyslaw Borowiecki, Anna Fiedorowicz:
Acyclic edge colouring of planar graphs without short cycles. Discret. Math. 310(9): 1445-1455 (2010) - [j6]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
- [j5]Mieczyslaw Borowiecki, Anna Fiedorowicz, Mariusz Haluszczak:
Acyclic reducible bounds for outerplanar graphs. Discuss. Math. Graph Theory 29(2): 219-239 (2009) - 2008
- [j4]Anna Fiedorowicz, Mariusz Haluszczak, Narayanan Narayanan:
About acyclic edge colourings of planar graphs. Inf. Process. Lett. 108(6): 412-417 (2008) - 2007
- [j3]Ewa Drgas-Burchardt, Anna Fiedorowicz:
Cost colourings of hypergraphs. Discret. Math. 307(11-12): 1298-1305 (2007) - 2006
- [j2]Mieczyslaw Borowiecki, Anna Fiedorowicz:
On partitions of hereditary properties of graphs. Discuss. Math. Graph Theory 26(3): 377-387 (2006) - 2005
- [j1]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)
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 2024-10-07 21:21 CEST 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:
