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