Roland Häggkvist

Publication Activity (10 Years)

Years Active: 1979-2019
Publications (10 Years): 3

Top Topics

Introduce A General Framework

Graph Theoretical

Electronic Circuits

Top Venues

J. Graph Theory

J. Comb. Theory, Ser. B

Publications

Herbert Fleischner, Roland Häggkvist, Arthur Hoffmann-Ostenhof
Cycle double covers via Kotzig graphs. J. Comb. Theory, Ser. B 135 (2019)
Carl Johan Casselgren, Roland Häggkvist
Coloring Complete and Complete Bipartite Graphs from Random Lists. Graphs Comb. 32 (2) (2016)
Herbert Fleischner, Roland Häggkvist
Cycle double covers containing certain circuits in cubic graphs having special structures. Discret. Math. 338 (10) (2015)
Herbert Fleischner, Roland Häggkvist
Cycle Double Covers in Cubic Graphs having Special Structures. J. Graph Theory 77 (2) (2014)
Carl Johan Casselgren, Roland Häggkvist
Completing partial Latin squares with one filled row, column and symbol. Discret. Math. 313 (9) (2013)
Herbert Fleischner, Roland Häggkvist
Circuit double covers in special types of cubic graphs. Discret. Math. 309 (18) (2009)
Roland Häggkvist
Ear decompositions of a cubic bridgeless graph and near P4-decompositions of its deck. Electron. Notes Discret. Math. 34 (2009)
Roland Häggkvist, Anders Johansson
Orthogonal Latin Rectangles. Comb. Probab. Comput. 17 (4) (2008)
Roland Häggkvist, Klas Markström
Cycle double covers and spanning minors II. Discret. Math. 306 (8-9) (2006)
Roland Häggkvist, Klas Markström
Cycle double covers and spanning minors I. J. Comb. Theory, Ser. B 96 (2) (2006)
Roland Häggkvist, Sean McGuinness
Double covers of cubic graphs with oddness 4. J. Comb. Theory, Ser. B 93 (2) (2005)
Roland Häggkvist, Robert Johansson
A note on edge-decompositions of planar graphs. Discret. Math. 283 (1-3) (2004)
Roland Häggkvist, Wolfgang Mader
-regular graphs. J. Graph Theory 39 (2) (2002)
Tristan Denley, Roland Häggkvist
Completing some Partial Latin Squares. Eur. J. Comb. 21 (7) (2000)
Roland Häggkvist, Guoping Jin
Graphs with Odd Girth at Least Seven and High Minimum Degree. Graphs Comb. 14 (4) (1998)
Roland Häggkvist, Jeannette C. M. Janssen
New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs. Comb. Probab. Comput. 6 (3) (1997)
Roland Häggkvist
Restricted Edge-colourings of Bipartite Graphs. Comb. Probab. Comput. 5 (1996)
Armen S. Asratian, Roland Häggkvist, G. V. Sarkisian
A characterization of panconnected graphs satisfying a local ore-type condition. J. Graph Theory 22 (2) (1996)
Roland Häggkvist, Jeannette C. M. Janssen
All-even latin squares. Discret. Math. 157 (1-3) (1996)
Amanda G. Chetwynd, Roland Häggkvist
An Improvement of Hind's Upper Bound on the Total Chromatic Number. Comb. Probab. Comput. 5 (1996)
Roland Häggkvist, Andrew Thomason
Oriented hamilton cycles in digraphs. J. Graph Theory 19 (4) (1995)
Roland Häggkvist, Anders Johansson
(1, 2)-Factorizations of General Eulerian Nearly Regular Graphs. Comb. Probab. Comput. 3 (1994)
Genghua Fan, Roland Häggkvist
The Square of a Hamiltonian Cycle. SIAM J. Discret. Math. 7 (2) (1994)
Roland Häggkvist, Pavol Hell
Universality of A-mote Graphs. Eur. J. Comb. 14 (1) (1993)
Roland Häggkvist
Hamilton Cycles in Oriented Graphs. Comb. Probab. Comput. 2 (1993)
Roland Häggkvist
On the structure of Non-Hamiltonian Graphs 1. Comb. Probab. Comput. 1 (1992)
Roland Häggkvist, Amanda G. Chetwynd
Some upper bounds on the total and list chromatic numbers of multigraphs. J. Graph Theory 16 (5) (1992)
Roland Häggkvist, Andrew Thomason
Trees in tournaments. Comb. 11 (2) (1991)
Béla Bollobás, Roland Häggkvist
Powers of Hamilton cycles in tournaments. J. Comb. Theory, Ser. B 50 (2) (1990)
Roland Häggkvist, Yannis Manoussakis
Cicles and paths in bipartite tournaments with spanning configurations. Comb. 9 (1) (1989)
Roland Häggkvist
On the path-complete bipartite Ramsey number. Discret. Math. 75 (1-3) (1989)
Roland Häggkvist
A note on latin squares with restricted support. Discret. Math. 75 (1-3) (1989)
Roland Häggkvist
Towards a solution of the dinitz problem? Discret. Math. 75 (1-3) (1989)
Amanda G. Chetwynd, Roland Häggkvist
A note on list-colorings. J. Graph Theory 13 (1) (1989)
Roland Häggkvist, Pavol Hell, Donald J. Miller, Victor Neumann-Lara
On multiplicative graphs and the product conjecture. Comb. 8 (1) (1988)
Brian Alspach, Roland Häggkvist
Some observations on the oberwolfach problem. J. Graph Theory 9 (1) (1985)
Jerrold W. Grossman, Roland Häggkvist
Alternating cycles in edge-partitioned graphs. J. Comb. Theory, Ser. B 34 (1) (1983)
Roland Häggkvist, P.-O. Lindberg, B. Lindström
Dissecting a square into rectangles of equal area. Discret. Math. 47 (1983)
Roland Häggkvist, Carsten Thomassen
Circuits through specified edges. Discret. Math. 41 (1) (1982)
Roland Häggkvist, G. G. Nicoghossian
A remark on Hamiltonian cycles. J. Comb. Theory, Ser. B 30 (1) (1981)
Roland Häggkvist, Pavol Hell
Parallel Sorting with Constant Time for Comparisons. SIAM J. Comput. 10 (3) (1981)
Lars Døvling Andersen, Roland Häggkvist, Anthony J. W. Hilton, William B. Poucher
Embedding Incomplete Latin Squares in Latin Squares Whose Diagonal is Almost Completely Prescribed. Eur. J. Comb. 1 (1) (1980)
Louis Caccetta, Roland Häggkvist
On diameter critical graphs. Discret. Math. 28 (3) (1979)