The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Roland Häggkvist: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Roland Häggkvist, Pavol Hell, Donald J. Miller, Victor Neumann-Lara
    On multiplicative graphs and the product conjecture. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:1, pp:63-74 [Journal]
  2. Roland Häggkvist, Yannis Manoussakis
    Cicles and paths in bipartite tournaments with spanning configurations. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:1, pp:33-38 [Journal]
  3. Roland Häggkvist, Andrew Thomason
    Trees in tournaments. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:2, pp:123-130 [Journal]
  4. Amanda G. Chetwynd, Roland Häggkvist
    An Improvement of Hind's Upper Bound on the Total Chromatic Number. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:94-104 [Journal]
  5. Roland Häggkvist
    Restricted Edge-colourings of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:385-392 [Journal]
  6. Roland Häggkvist, Anders Johansson
    (1, 2)-Factorizations of General Eulerian Nearly Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:87-95 [Journal]
  7. Roland Häggkvist, Jeannette Janssen
    New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:3, pp:295-313 [Journal]
  8. Roland Häggkvist
    On the structure of Non-Hamiltonian Graphs 1. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:27-34 [Journal]
  9. Roland Häggkvist
    Hamilton Cycles in Oriented Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:25-32 [Journal]
  10. Roland Häggkvist, Robert Johansson
    A note on edge-decompositions of planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:283, n:1-3, pp:263-266 [Journal]
  11. Roland Häggkvist, Klas Markström
    Cycle double covers and spanning minors II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:8-9, pp:762-778 [Journal]
  12. Tristan Denley, Roland Häggkvist
    Completing some Partial Latin Squares. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:7, pp:877-880 [Journal]
  13. Roland Häggkvist, Pavol Hell
    Universality of A-mote Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:1, pp:23-27 [Journal]
  14. Béla Bollobás, Roland Häggkvist
    Powers of Hamilton cycles in tournaments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:309-318 [Journal]
  15. Jerrold W. Grossman, Roland Häggkvist
    Alternating cycles in edge-partitioned graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1983, v:34, n:1, pp:77-81 [Journal]
  16. Roland Häggkvist, Sean McGuinness
    Double covers of cubic graphs with oddness 4. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:93, n:2, pp:251-277 [Journal]
  17. Roland Häggkvist, Klas Markström
    Cycle double covers and spanning minors I. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:2, pp:183-206 [Journal]
  18. Roland Häggkvist, G. G. Nicoghossian
    A remark on Hamiltonian cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:118-120 [Journal]
  19. Roland Häggkvist, Pavol Hell
    Parallel Sorting with Constant Time for Comparisons. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:3, pp:465-472 [Journal]
  20. Genghua Fan, Roland Häggkvist
    The Square of a Hamiltonian Cycle. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:2, pp:203-212 [Journal]
  21. Roland Häggkvist, Carsten Thomassen
    Circuits through specified edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:29-34 [Journal]
  22. Roland Häggkvist, P.-O. Lindberg, B. Lindström
    Dissecting a square into rectangles of equal area. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:321-323 [Journal]
  23. Roland Häggkvist
    On the path-complete bipartite Ramsey number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:243-245 [Journal]
  24. Roland Häggkvist
    Towards a solution of the dinitz problem? [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:247-251 [Journal]
  25. Roland Häggkvist
    A note on latin squares with restricted support. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:253-254 [Journal]
  26. Roland Häggkvist, Jeannette C. M. Janssen
    All-even latin squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:157, n:1-3, pp:199-206 [Journal]

  27. Orthogonal Latin Rectangles. [Citation Graph (, )][DBLP]


  28. Circuit double covers in special types of cubic graphs. [Citation Graph (, )][DBLP]


Search in 0.268secs, Finished in 0.269secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002