default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIrmina A. Ziolo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j15]Sylwia Cichacz
, Irmina A. Ziolo:
2-swappable graphs. AKCE Int. J. Graphs Comb. 15(3): 242-250 (2018)
2000 – 2009
- 2009
- [j14]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
Arbitrarily vertex decomposable suns with few rays. Discret. Math. 309(11): 3726-3732 (2009) - [j13]Mariusz Meszka, Alexander Rosa, Irmina A. Ziolo:
Steiner almost self-complementary graphs and halving near-Steiner triple systems. Discret. Math. 309(18): 5650-5654 (2009) - [j12]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
On-line arbitrarily vertex decomposable suns. Discret. Math. 309(22): 6328-6336 (2009) - 2007
- [j11]A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo:
On Self-Complementary Cyclic Packing of Forests. Electron. J. Comb. 14(1) (2007) - [j10]Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
Fixed-point-free embeddings of digraphs with small size. Discret. Math. 307(11-12): 1332-1340 (2007) - 2006
- [j9]Sylwia Cichacz, Irmina A. Ziolo:
On arbitraly vertex decomposable unicyclic graphs with dominating cycle. Discuss. Math. Graph Theory 26(3): 403-412 (2006) - 2005
- [j8]A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo:
On self-complementary supergraphs of (n, n)-graphs. Discret. Math. 292(1-3): 167-185 (2005) - [j7]A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo:
Erratum to "On self-complementary supergraphs of (n, n)-graphs" [Discrete Math. 292(2005) 167-185]. Discret. Math. 301(2-3): 247 (2005) - [j6]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
Some families of arbitrarily vertex decomposable graphs. Electron. Notes Discret. Math. 22: 451-454 (2005) - 2004
- [j5]Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
A note on embedding graphs without short cycles. Discret. Math. 286(1-2): 75-77 (2004) - 2001
- [j4]Irmina A. Ziolo:
Subforests of bipartite digraphs -- the minimum degree condition. Discret. Math. 236(1-3): 351-365 (2001) - 2000
- [j3]Irmina A. Ziolo:
Subtrees of Bipartite Digraphs - The Minimum Degree Condition. Discret. Appl. Math. 99(1-3): 251-259 (2000) - [j2]A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo:
On self-complementary supergraphs of (n, n)-graphs. Electron. Notes Discret. Math. 5: 307-310 (2000)
1990 – 1999
- 1997
- [j1]A. Pawel Wojda, Irmina A. Ziolo:
Embedding digraphs of small size. Discret. Math. 165-166: 621-638 (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-21 00:21 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:
