default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntoni Marczyk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j24]Olivier Baudon, Hervé Hocquard, Antoni Marczyk, Monika Pilsniak
, Jakub Przybylo, Mariusz Wozniak:
On a total version of 1-2-3 Conjecture. Discuss. Math. Graph Theory 40(4): 1175-1186 (2020)
2010 – 2019
- 2017
- [j23]Evelyne Flandrin, Hao Li, Antoni Marczyk, Jean-François Saclé, Mariusz Wozniak:
A note on neighbor expanded sum distinguishing index. Discuss. Math. Graph Theory 37(1): 29-37 (2017) - 2014
- [j22]Olivier Baudon, Julien Bensmail, Rafal Kalinowski, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak:
On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph. Discret. Math. Theor. Comput. Sci. 16(1): 225-232 (2014) - 2013
- [j21]Evelyne Flandrin, Antoni Marczyk, Jakub Przybylo, Jean-François Saclé, Mariusz Wozniak:
Neighbor Sum Distinguishing Index. Graphs Comb. 29(5): 1329-1336 (2013) - 2012
- [j20]Mirko Hornák, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak:
Dense Arbitrarily Vertex Decomposable Graphs. Graphs Comb. 28(6): 807-821 (2012)
2000 – 2009
- 2009
- [j19]Antoni Marczyk:
An Ore-type condition for arbitrarily vertex decomposable graphs. Discret. Math. 309(11): 3588-3594 (2009) - 2007
- [j18]Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs. Discret. Math. 307(7-8): 878-884 (2007) - [j17]Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A Chvátal-Erdos type condition for pancyclability. Discret. Math. 307(11-12): 1463-1466 (2007) - 2006
- [j16]Sylwia Cichacz, Agnieszka Görlich, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak:
Arbitrarily vertex decomposable caterpillars with four or five leaves. Discuss. Math. Graph Theory 26(2): 291-305 (2006) - [j15]Evelyne Flandrin, Hao Li, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak:
Chvátal-Erdös condition and pancyclism. Discuss. Math. Graph Theory 26(2): 335-342 (2006) - 2005
- [j14]Antoni Marczyk:
An Ore-type condition for arbitrarily vertex decomposable graphs. Electron. Notes Discret. Math. 22: 477-480 (2005) - [j13]Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A Note on a Generalisation of Ore's Condition. Graphs Comb. 21(2): 213-216 (2005) - 2004
- [j12]Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A note on pancyclism of highly connected graphs. Discret. Math. 286(1-2): 57-60 (2004) - [j11]Antoni Marczyk:
On the structure of the set of cycle lengths in a hamiltonian graph. Discret. Math. 286(1-2): 133-140 (2004) - [j10]Antoni Marczyk:
On the Set of Cycle Lengths in a Hamiltonian Graph with a Given Maximum Degree. Graphs Comb. 20(4): 517-529 (2004) - 2003
- [j9]Antoni Marczyk, Mariusz Wozniak:
Cycles in hamiltonian graphs of prescribed maximum degree. Discret. Math. 266(1-3): 321-326 (2003) - 2002
- [j8]Mekkia Kouider, Antoni Marczyk:
On pancyclism in hamiltonian graphs. Discret. Math. 251(1-3): 119-127 (2002) - 2001
- [j7]Rafal Kalinowski, Antoni Marczyk, Mariusz Meszka, A. Pawel Wojda:
Preface. Discret. Math. 236(1-3): 1- (2001) - [j6]Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A note on a new condition implying pancyclism. Discuss. Math. Graph Theory 21(1): 137-143 (2001) - 2000
- [j5]Antoni Marczyk, Günter Schaar:
On traceable powers of digraphs. Discret. Math. 212(1-2): 121-128 (2000) - [j4]Antoni Marczyk:
On pancyclism of hamiltonian graphs. Electron. Notes Discret. Math. 5: 218-221 (2000) - [j3]Antoni Marczyk:
On Hamiltonian Powers of Digraphs. Graphs Comb. 16(1): 103-113 (2000)
1990 – 1999
- 1996
- [j2]Antoni Marczyk:
Hamiltonian cycles in the square of two-connected graph with given circumference. Ars Comb. 43 (1996) - 1991
- [j1]Antoni Marczyk, Zdzislaw Skupien:
Maximum nonhamiltonian tough graphs. Discret. Math. 96(3): 213-220 (1991)
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-04-24 23:05 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:
