default search action
Mariusz Haluszczak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j15]Marta Borowiecka-Olszewska
, Ewa Drgas-Burchardt
On the structure and deficiency of k-trees with bounded degree. Discret. Appl. Math. 201: 24-37 (2016) - 2013
- [j14]Marta Borowiecka-Olszewska
On Ramsey (K1, m, G)(K1, m, G)-minimal graphs. Discret. Math. 313(19): 1843-1855 (2013) - [j13]Ewa Drgas-Burchardt
Preface. Discuss. Math. Graph Theory 33(1): 5-6 (2013) - 2012
- [j12]Mariusz Haluszczak:
On Ramsey (K1, 2, Kn)-minimal graphs. Discuss. Math. Graph Theory 32(2): 331-339 (2012) - [j11]Anna Fiedorowicz
Acyclic chromatic indices of fully subdivided graphs. Inf. Process. Lett. 112(13): 557-561 (2012) - 2010
- [j10]Ewa Drgas-Burchardt, Mariusz Haluszczak, Peter Mihók:
Minimal forbidden graphs of reducible additive hereditary graph properties. Ars Comb. 95 (2010)
2000 – 2009
- 2009
- [j9]Mieczyslaw Borowiecki, Anna Fiedorowicz
Acyclic reducible bounds for outerplanar graphs. Discuss. Math. Graph Theory 29(2): 219-239 (2009) - 2008
- [j8]Anna Fiedorowicz
About acyclic edge colourings of planar graphs. Inf. Process. Lett. 108(6): 412-417 (2008) - 2004
- [j7]Jaroslaw Grytczuk
On-line Ramsey Theory. Electron. J. Comb. 11(1) (2004) - [j6]Mieczyslaw Borowiecki, Mariusz Haluszczak, Elzbieta Sidorowicz
On Ramsey minimal graphs. Discret. Math. 286(1-2): 37-43 (2004) - 2003
- [j5]Mieczyslaw Borowiecki, Jaroslaw Grytczuk
Schütte's Tournament Problem and Intersecting Families of Sets. Comb. Probab. Comput. 12(4): 359-364 (2003) - 2002
- [j4]Noga Alon, Jaroslaw Grytczuk
Nonrepetitive colorings of graphs. Random Struct. Algorithms 21(3-4): 336-346 (2002) - 2000
- [j3]Mieczyslaw Borowiecki, Mariusz Haluszczak, Miroslawa Skowronska:
Minimal reducible bounds for 1-nonouterplanar graphs. Discret. Math. 219(1-3): 9-15 (2000)
1990 – 1999
- 1999
- [j2]Mariusz Haluszczak, Pavol Vateha:
On the completeness of decomposable properties of graphs. Discuss. Math. Graph Theory 19(2): 229-236 (1999) - 1997
- [j1]Piotr Borowiecki
Partitions of some planar graphs into two linear forests. Discuss. Math. Graph Theory 17(1): 95-102 (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 2024-08-05 21:13 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: