Roland Häggkvist

According to our database, Roland Häggkvist authored at least 43 papers between 1979 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2019

Cycle double covers via Kotzig graphs.

Herbert Fleischner, Roland Häggkvist, Arthur Hoffmann-Ostenhof

J. Comb. Theory B, 2019

2016

Coloring Complete and Complete Bipartite Graphs from Random Lists.

Carl Johan Casselgren, Roland Häggkvist

Graphs Comb., 2016

2015

Cycle double covers containing certain circuits in cubic graphs having special structures.

Herbert Fleischner, Roland Häggkvist

Discret. Math., 2015

2014

Cycle Double Covers in Cubic Graphs having Special Structures.

Herbert Fleischner, Roland Häggkvist

J. Graph Theory, 2014

2013

Completing partial Latin squares with one filled row, column and symbol.

Carl Johan Casselgren, Roland Häggkvist

Discret. Math., 2013

2009

Ear decompositions of a cubic bridgeless graph and near P4-decompositions of its deck.

Roland Häggkvist

Electron. Notes Discret. Math., 2009

Circuit double covers in special types of cubic graphs.

Herbert Fleischner, Roland Häggkvist

Discret. Math., 2009

2008

Orthogonal Latin Rectangles.

Roland Häggkvist, Anders Johansson

Comb. Probab. Comput., 2008

2006

Cycle double covers and spanning minors I.

Roland Häggkvist, Klas Markström

J. Comb. Theory B, 2006

Cycle double covers and spanning minors II.

Roland Häggkvist, Klas Markström

Discret. Math., 2006

2005

Double covers of cubic graphs with oddness 4.

Roland Häggkvist, Sean McGuinness

J. Comb. Theory B, 2005

2004

A note on edge-decompositions of planar graphs.

Roland Häggkvist, Robert Johansson

Discret. Math., 2004

2002

Circuits through prescribed vertices in <i>k</i>-connected <i>k</i>-regular graphs.

Roland Häggkvist, Wolfgang Mader

J. Graph Theory, 2002

2000

Completing some Partial Latin Squares.

Tristan Denley, Roland Häggkvist

Eur. J. Comb., 2000

1998

Graphs with Odd Girth at Least Seven and High Minimum Degree.

Roland Häggkvist, Guoping Jin

Graphs Comb., 1998

1997

New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs.

Roland Häggkvist, Jeannette C. M. Janssen

Comb. Probab. Comput., 1997

1996

A characterization of panconnected graphs satisfying a local ore-type condition.

Armen S. Asratian, Roland Häggkvist, G. V. Sarkisian

J. Graph Theory, 1996

All-even latin squares.

Roland Häggkvist, Jeannette C. M. Janssen

Discret. Math., 1996

Restricted Edge-colourings of Bipartite Graphs.

Roland Häggkvist

Comb. Probab. Comput., 1996

An Improvement of Hind's Upper Bound on the Total Chromatic Number.

Amanda G. Chetwynd, Roland Häggkvist

Comb. Probab. Comput., 1996

1995

Oriented hamilton cycles in digraphs.

Roland Häggkvist, Andrew Thomason

J. Graph Theory, 1995

1994

The Square of a Hamiltonian Cycle.

Genghua Fan, Roland Häggkvist

SIAM J. Discret. Math., 1994

(1, 2)-Factorizations of General Eulerian Nearly Regular Graphs.

Roland Häggkvist, Anders Johansson

Comb. Probab. Comput., 1994

1993

Universality of A-mote Graphs.

Roland Häggkvist, Pavol Hell

Eur. J. Comb., 1993

Hamilton Cycles in Oriented Graphs.

Roland Häggkvist

Comb. Probab. Comput., 1993

1992

Some upper bounds on the total and list chromatic numbers of multigraphs.

Roland Häggkvist, Amanda G. Chetwynd

J. Graph Theory, 1992

On the structure of Non-Hamiltonian Graphs 1.

Roland Häggkvist

Comb. Probab. Comput., 1992

1991

Trees in tournaments.

Roland Häggkvist, Andrew Thomason

Comb., 1991

1990

Powers of Hamilton cycles in tournaments.

Béla Bollobás, Roland Häggkvist

J. Comb. Theory B, 1990

1989

A note on list-colorings.

Amanda G. Chetwynd, Roland Häggkvist

J. Graph Theory, 1989

A note on latin squares with restricted support.

Roland Häggkvist

Discret. Math., 1989

Towards a solution of the dinitz problem?

Roland Häggkvist

Discret. Math., 1989

On the path-complete bipartite Ramsey number.

Roland Häggkvist

Discret. Math., 1989

Cicles and paths in bipartite tournaments with spanning configurations.

Roland Häggkvist, Yannis Manoussakis

Comb., 1989

1988

On multiplicative graphs and the product conjecture.

Roland Häggkvist, Pavol Hell, Donald J. Miller, Victor Neumann-Lara

Comb., 1988

1985

Some observations on the oberwolfach problem.

Brian Alspach, Roland Häggkvist

J. Graph Theory, 1985

1983

Alternating cycles in edge-partitioned graphs.

Jerrold W. Grossman, Roland Häggkvist

J. Comb. Theory B, 1983

Dissecting a square into rectangles of equal area.

Roland Häggkvist, Per Olov Lindberg, B. Lindström

Discret. Math., 1983

1982

Circuits through specified edges.

Roland Häggkvist, Carsten Thomassen

Discret. Math., 1982

1981

Parallel Sorting with Constant Time for Comparisons.

Roland Häggkvist, Pavol Hell

SIAM J. Comput., 1981

A remark on Hamiltonian cycles.

Roland Häggkvist, G. G. Nicoghossian

J. Comb. Theory B, 1981

1980

Embedding Incomplete Latin Squares in Latin Squares Whose Diagonal is Almost Completely Prescribed.

Lars Døvling Andersen, Roland Häggkvist, Anthony J. W. Hilton, William B. Poucher

Eur. J. Comb., 1980

1979

On diameter critical graphs.

Louis Caccetta, Roland Häggkvist

Discret. Math., 1979