The SCEAS System
Navigation Menu

Search the dblp DataBase


Dwight Duffus: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dwight Duffus, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski
    Endomorphisms of Partially Ordered Sets. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:1, pp:33-46 [Journal]
  2. Dwight Duffus, Ted Goddard
    Some progress on the Aharoni-Korman conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:250, n:1-3, pp:79-91 [Journal]
  3. Dwight Duffus, Norbert W. Sauer
    Chromatic numbers and products. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:300, n:1-3, pp:91-99 [Journal]
  4. Dwight Duffus
    Matching in Modular Lattices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:32, n:3, pp:303-314 [Journal]
  5. Dwight Duffus, Hal A. Kierstead, William T. Trotter
    Fibres and ordered set coloring. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1991, v:58, n:1, pp:158-164 [Journal]
  6. Dwight Duffus, Ivan Rival
    Separable Subsets of a Finite Lattice. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1978, v:25, n:2, pp:188-192 [Journal]
  7. Dwight Duffus, Bill Sands, Norbert Sauer, Robert E. Woodrow
    Two-colouring all two-element maximal antichains. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1991, v:57, n:1, pp:109-116 [Journal]
  8. Dwight Duffus
    Obituary: Ivan Rival. [Citation Graph (0, 0)][DBLP]
    Order, 2003, v:20, n:3, pp:173-183 [Journal]
  9. Dwight Duffus, Ted Goddard
    An Ordered Set of Size aleph1 with Monochromatic Maximal Chains. [Citation Graph (0, 0)][DBLP]
    Order, 2000, v:17, n:3, pp:227-238 [Journal]
  10. Dwight Duffus, Mark Ginn, Vojtech Rödl
    On the Computational Complexity of Ordered Subgraph Recognition. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:7, n:3, pp:223-268 [Journal]
  11. Dwight Duffus, Bill Sands, Peter Winkler
    Maximal Chains and Antichains in Boolean Lattices. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:2, pp:197-205 [Journal]
  12. Dwight Duffus, Ivan Rival, Miklós Simonovits
    Spanning retracts of a partially ordered set. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1980, v:32, n:1, pp:1-7 [Journal]
  13. Dwight Duffus, Ivan Rival
    A structure theory for ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:53-118 [Journal]
  14. Dwight Duffus, Maurice Pouzet, Ivan Rival
    Complete ordered sets with no infinite antichains. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:35, n:1-3, pp:39-52 [Journal]
  15. Dwight Duffus, Bill Sands
    An inequality for the sizes of prime filters of finite distributive lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:201, n:1-3, pp:89-99 [Journal]
  16. Martin Aigner, Dwight Duffus, Daniel J. Kleitman
    Partitioning a power set into union-free classes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:113-119 [Journal]
  17. Dwight Duffus, Norbert Sauer
    Lattices arising in categorial investigations of Hedetniemi's conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:152, n:1-3, pp:125-139 [Journal]
  18. Dwight Duffus, Hanno Lefmann, Vojtech Rödl
    Shift graphs and lower bounds on Ramsey numbers rk(l; r). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:137, n:1-3, pp:177-187 [Journal]

  19. Splitting Numbers of Grids. [Citation Graph (, )][DBLP]

  20. On the size of maximal chains and the number of pairwise disjoint maximal antichains. [Citation Graph (, )][DBLP]

Search in 0.019secs, Finished in 0.020secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002