- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j36 |      | Carl Johan Casselgren, Roland Häggkvist: Completing partial Latin squares with one filled row, column and symbol. Discrete Mathematics 313(9): 1011-1017 (2013) |
| 2009 | ||
| j35 | | Herbert Fleischner, Roland Häggkvist: Circuit double covers in special types of cubic graphs. Discrete Mathematics 309(18): 5724-5728 (2009) |
| j34 | | Roland Häggkvist: Ear decompositions of a cubic bridgeless graph and near P4-decompositions of its deck. Electronic Notes in Discrete Mathematics 34: 191-198 (2009) |
| 2008 | ||
| j33 | | Roland Häggkvist, Anders Johansson: Orthogonal Latin Rectangles. Combinatorics, Probability & Computing 17(4): 519-536 (2008) |
| 2006 | ||
| j32 | | Roland Häggkvist, Klas Markström: Cycle double covers and spanning minors II. Discrete Mathematics 306(8-9): 762-778 (2006) |
| j31 | | Roland Häggkvist, Klas Markström: Cycle double covers and spanning minors I. J. Comb. Theory, Ser. B 96(2): 183-206 (2006) |
| 2005 | ||
| j30 | | Roland Häggkvist, Sean McGuinness: Double covers of cubic graphs with oddness 4. J. Comb. Theory, Ser. B 93(2): 251-277 (2005) |
| 2004 | ||
| j29 | | Roland Häggkvist, Robert Johansson: A note on edge-decompositions of planar graphs. Discrete Mathematics 283(1-3): 263-266 (2004) |
| 2002 | ||
| j28 | | Roland Häggkvist, Wolfgang Mader: Circuits through prescribed vertices in k-connected k-regular graphs. Journal of Graph Theory 39(2): 145-163 (2002) |
| 2000 | ||
| j27 | | Tristan Denley, Roland Häggkvist: Completing some Partial Latin Squares. Eur. J. Comb. 21(7): 877-880 (2000) |
| 1998 | ||
| j26 | | Roland Häggkvist, Guoping Jin: Graphs with Odd Girth at Least Seven and High Minimum Degree. Graphs and Combinatorics 14(4): 351-362 (1998) |
| 1997 | ||
| j25 | | 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 | ||
| j24 | | 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) |
| j23 | | Roland Häggkvist: Restricted Edge-colourings of Bipartite Graphs. Combinatorics, Probability & Computing 5: 385-392 (1996) |
| j22 | | Roland Häggkvist, Jeannette C. M. Janssen: All-even latin squares. Discrete Mathematics 157(1-3): 199-206 (1996) |
| j21 | | Armen S. Asratian, Roland Häggkvist, G. V. Sarkisian: A characterization of panconnected graphs satisfying a local ore-type condition. Journal of Graph Theory 22(2): 95-103 (1996) |
| 1995 | ||
| j20 | | Roland Häggkvist, Andrew Thomason: Oriented hamilton cycles in digraphs. Journal of Graph Theory 19(4): 471-479 (1995) |
| 1994 | ||
| j19 | | Roland Häggkvist, Anders Johansson: (1, 2)-Factorizations of General Eulerian Nearly Regular Graphs. Combinatorics, Probability & Computing 3: 87-95 (1994) |
| j18 | | Genghua Fan, Roland Häggkvist: The Square of a Hamiltonian Cycle. SIAM J. Discrete Math. 7(2): 203-212 (1994) |
| 1993 | ||
| j17 | | Roland Häggkvist: Hamilton Cycles in Oriented Graphs. Combinatorics, Probability & Computing 2: 25-32 (1993) |
| j16 | | |
| 1992 | ||
| j15 | | Roland Häggkvist: On the structure of Non-Hamiltonian Graphs 1. Combinatorics, Probability & Computing 1: 27-34 (1992) |
| j14 | | Roland Häggkvist, Amanda G. Chetwynd: Some upper bounds on the total and list chromatic numbers of multigraphs. Journal of Graph Theory 16(5): 503-516 (1992) |
| 1991 | ||
| j13 | | |
| 1990 | ||
| j12 | | Béla Bollobás, Roland Häggkvist: Powers of Hamilton cycles in tournaments. J. Comb. Theory, Ser. B 50(2): 309-318 (1990) |
| 1989 | ||
| j11 | | Roland Häggkvist, Yannis Manoussakis: Cicles and paths in bipartite tournaments with spanning configurations. Combinatorica 9(1): 33-38 (1989) |
| j10 | | Roland Häggkvist: On the path-complete bipartite Ramsey number. Discrete Mathematics 75(1-3): 243-245 (1989) |
| j9 | | Roland Häggkvist: Towards a solution of the dinitz problem? Discrete Mathematics 75(1-3): 247-251 (1989) |
| j8 | | Roland Häggkvist: A note on latin squares with restricted support. Discrete Mathematics 75(1-3): 253-254 (1989) |
| j7 | | Amanda G. Chetwynd, Roland Häggkvist: A note on list-colorings. Journal of Graph Theory 13(1): 87-95 (1989) |
| 1988 | ||
| j6 | | 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 | ||
| j5 | | Roland Häggkvist, P.-O. Lindberg, B. Lindström: Dissecting a square into rectangles of equal area. Discrete Mathematics 47: 321-323 (1983) |
| j4 | | Jerrold W. Grossman, Roland Häggkvist: Alternating cycles in edge-partitioned graphs. J. Comb. Theory, Ser. B 34(1): 77-81 (1983) |
| 1982 | ||
| j3 | | Roland Häggkvist, Carsten Thomassen: Circuits through specified edges. Discrete Mathematics 41(1): 29-34 (1982) |
| 1981 | ||
| j2 | | Roland Häggkvist, G. G. Nicoghossian: A remark on Hamiltonian cycles. J. Comb. Theory, Ser. B 30(1): 118-120 (1981) |
| j1 | | Roland Häggkvist, Pavol Hell: Parallel Sorting with Constant Time for Comparisons. SIAM J. Comput. 10(3): 465-472 (1981) |
Colors in the list of coauthors
Last update Thu May 23 14:51:13 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page