2007 |
14 | EE | Evelyne Flandrin,
Hao Li,
Antoni Marczyk,
Mariusz Wozniak:
A Chvátal-Erdos type condition for pancyclability.
Discrete Mathematics 307(11-12): 1463-1466 (2007) |
13 | EE | Evelyne Flandrin,
Hao Li,
Antoni Marczyk,
Mariusz Wozniak:
A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs.
Discrete Mathematics 307(7-8): 878-884 (2007) |
2005 |
12 | EE | Antoni Marczyk:
An Ore-type condition for arbitrarily vertex decomposable graphs.
Electronic Notes in Discrete Mathematics 22: 477-480 (2005) |
11 | EE | Evelyne Flandrin,
Hao Li,
Antoni Marczyk,
Mariusz Wozniak:
A Note on a Generalisation of Ore's Condition.
Graphs and Combinatorics 21(2): 213-216 (2005) |
2004 |
10 | EE | Antoni Marczyk:
On the structure of the set of cycle lengths in a hamiltonian graph.
Discrete Mathematics 286(1-2): 133-140 (2004) |
9 | EE | Evelyne Flandrin,
Hao Li,
Antoni Marczyk,
Mariusz Wozniak:
A note on pancyclism of highly connected graphs.
Discrete Mathematics 286(1-2): 57-60 (2004) |
8 | EE | Antoni Marczyk:
On the Set of Cycle Lengths in a Hamiltonian Graph with a Given Maximum Degree.
Graphs and Combinatorics 20(4): 517-529 (2004) |
2003 |
7 | EE | Antoni Marczyk,
Mariusz Wozniak:
Cycles in hamiltonian graphs of prescribed maximum degree.
Discrete Mathematics 266(1-3): 321-326 (2003) |
2002 |
6 | EE | Mekkia Kouider,
Antoni Marczyk:
On pancyclism in hamiltonian graphs.
Discrete Mathematics 251(1-3): 119-127 (2002) |
2001 |
5 | EE | Rafal Kalinowski,
Antoni Marczyk,
Mariusz Meszka,
A. Pawel Wojda:
Preface.
Discrete Mathematics 236(1-3): 1- (2001) |
2000 |
4 | EE | Antoni Marczyk,
Günter Schaar:
On traceable powers of digraphs.
Discrete Mathematics 212(1-2): 121-128 (2000) |
3 | EE | Antoni Marczyk:
On pancyclism of hamiltonian graphs.
Electronic Notes in Discrete Mathematics 5: 218-221 (2000) |
1996 |
2 | | Antoni Marczyk:
Hamiltonian cycles in the square of two-connected graph with given circumference.
Ars Comb. 43: (1996) |
1991 |
1 | EE | Antoni Marczyk,
Zdzislaw Skupien:
Maximum nonhamiltonian tough graphs.
Discrete Mathematics 96(3): 213-220 (1991) |