Antoni Marczyk

According to our database1, Antoni Marczyk authored at least 23 papers between 1991 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On a total version of 1-2-3 Conjecture.
Discuss. Math. Graph Theory, 2020

2017
A note on neighbor expanded sum distinguishing index.
Discuss. Math. Graph Theory, 2017

2014
On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph.
Discret. Math. Theor. Comput. Sci., 2014

2013
Neighbor Sum Distinguishing Index.
Graphs Comb., 2013

2012
Dense Arbitrarily Vertex Decomposable Graphs.
Graphs Comb., 2012

2007
A Chvátal-Erdos type condition for pancyclability.
Discret. Math., 2007

A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs.
Discret. Math., 2007

2006
Chvátal-Erdös condition and pancyclism.
Discuss. Math. Graph Theory, 2006

Arbitrarily vertex decomposable caterpillars with four or five leaves.
Discuss. Math. Graph Theory, 2006

2005
A Note on a Generalisation of Ore's Condition.
Graphs Comb., 2005

An Ore-type condition for arbitrarily vertex decomposable graphs.
Electron. Notes Discret. Math., 2005

2004
On the Set of Cycle Lengths in a Hamiltonian Graph with a Given Maximum Degree.
Graphs Comb., 2004

On the structure of the set of cycle lengths in a hamiltonian graph.
Discret. Math., 2004

A note on pancyclism of highly connected graphs.
Discret. Math., 2004

2003
Cycles in hamiltonian graphs of prescribed maximum degree.
Discret. Math., 2003

2002
On pancyclism in hamiltonian graphs.
Discret. Math., 2002

2001
A note on a new condition implying pancyclism.
Discuss. Math. Graph Theory, 2001

Preface.
Discret. Math., 2001

2000
On Hamiltonian Powers of Digraphs.
Graphs Comb., 2000

On pancyclism of hamiltonian graphs.
Electron. Notes Discret. Math., 2000

On traceable powers of digraphs.
Discret. Math., 2000

1996
Hamiltonian cycles in the square of two-connected graph with given circumference.
Ars Comb., 1996

1991
Maximum nonhamiltonian tough graphs.
Discret. Math., 1991


  Loading...