Roland Häggkvist

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