The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Antoni Marczyk: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  13. An Ore-type condition for arbitrarily vertex decomposable graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002