Roland Häggkvist

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Cycle double covers via Kotzig graphs.
J. Comb. Theory B, 2019

2016
Coloring Complete and Complete Bipartite Graphs from Random Lists.
Graphs Comb., 2016

2015
Cycle double covers containing certain circuits in cubic graphs having special structures.
Discret. Math., 2015

2014
Cycle Double Covers in Cubic Graphs having Special Structures.
J. Graph Theory, 2014

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

2009
Ear decompositions of a cubic bridgeless graph and near P4-decompositions of its deck.
Electron. Notes Discret. Math., 2009

Circuit double covers in special types of cubic graphs.
Discret. Math., 2009

2008
Orthogonal Latin Rectangles.
Comb. Probab. Comput., 2008

2006
Cycle double covers and spanning minors I.
J. Comb. Theory B, 2006

Cycle double covers and spanning minors II.
Discret. Math., 2006

2005
Double covers of cubic graphs with oddness 4.
J. Comb. Theory B, 2005

2004
A note on edge-decompositions of planar graphs.
Discret. Math., 2004

2002
Circuits through prescribed vertices in <i>k</i>-connected <i>k</i>-regular graphs.
J. Graph Theory, 2002

2000
Completing some Partial Latin Squares.
Eur. J. Comb., 2000

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

1997
New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs.
Comb. Probab. Comput., 1997

1996
A characterization of panconnected graphs satisfying a local ore-type condition.
J. Graph Theory, 1996

All-even latin squares.
Discret. Math., 1996

Restricted Edge-colourings of Bipartite Graphs.
Comb. Probab. Comput., 1996

An Improvement of Hind's Upper Bound on the Total Chromatic Number.
Comb. Probab. Comput., 1996

1995
Oriented hamilton cycles in digraphs.
J. Graph Theory, 1995

1994
The Square of a Hamiltonian Cycle.
SIAM J. Discret. Math., 1994

(1, 2)-Factorizations of General Eulerian Nearly Regular Graphs.
Comb. Probab. Comput., 1994

1993
Universality of A-mote Graphs.
Eur. J. Comb., 1993

Hamilton Cycles in Oriented Graphs.
Comb. Probab. Comput., 1993

1992
Some upper bounds on the total and list chromatic numbers of multigraphs.
J. Graph Theory, 1992

On the structure of Non-Hamiltonian Graphs 1.
Comb. Probab. Comput., 1992

1991
Trees in tournaments.
Comb., 1991

1990
Powers of Hamilton cycles in tournaments.
J. Comb. Theory B, 1990

1989
A note on list-colorings.
J. Graph Theory, 1989

A note on latin squares with restricted support.
Discret. Math., 1989

Towards a solution of the dinitz problem?
Discret. Math., 1989

On the path-complete bipartite Ramsey number.
Discret. Math., 1989

Cicles and paths in bipartite tournaments with spanning configurations.
Comb., 1989

1988
On multiplicative graphs and the product conjecture.
Comb., 1988

1985
Some observations on the oberwolfach problem.
J. Graph Theory, 1985

1983
Alternating cycles in edge-partitioned graphs.
J. Comb. Theory B, 1983

Dissecting a square into rectangles of equal area.
Discret. Math., 1983

1982
Circuits through specified edges.
Discret. Math., 1982

1981
Parallel Sorting with Constant Time for Comparisons.
SIAM J. Comput., 1981

A remark on Hamiltonian cycles.
J. Comb. Theory B, 1981

1980
Embedding Incomplete Latin Squares in Latin Squares Whose Diagonal is Almost Completely Prescribed.
Eur. J. Comb., 1980

1979
On diameter critical graphs.
Discret. Math., 1979


  Loading...