default search action
Roland Häggkvist
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j43]Herbert Fleischner, Roland Häggkvist, Arthur Hoffmann-Ostenhof:
Cycle double covers via Kotzig graphs. J. Comb. Theory B 135: 212-226 (2019) - 2016
- [j42]Carl Johan Casselgren, Roland Häggkvist:
Coloring Complete and Complete Bipartite Graphs from Random Lists. Graphs Comb. 32(2): 533-542 (2016) - 2015
- [j41]Herbert Fleischner, Roland Häggkvist:
Cycle double covers containing certain circuits in cubic graphs having special structures. Discret. Math. 338(10): 1750-1754 (2015) - 2014
- [j40]Herbert Fleischner, Roland Häggkvist:
Cycle Double Covers in Cubic Graphs having Special Structures. J. Graph Theory 77(2): 158-170 (2014) - 2013
- [j39]Carl Johan Casselgren, Roland Häggkvist:
Completing partial Latin squares with one filled row, column and symbol. Discret. Math. 313(9): 1011-1017 (2013)
2000 – 2009
- 2009
- [j38]Herbert Fleischner, Roland Häggkvist:
Circuit double covers in special types of cubic graphs. Discret. Math. 309(18): 5724-5728 (2009) - [j37]Roland Häggkvist:
Ear decompositions of a cubic bridgeless graph and near P4-decompositions of its deck. Electron. Notes Discret. Math. 34: 191-198 (2009) - 2008
- [j36]Roland Häggkvist, Anders Johansson:
Orthogonal Latin Rectangles. Comb. Probab. Comput. 17(4): 519-536 (2008) - 2006
- [j35]Roland Häggkvist, Klas Markström:
Cycle double covers and spanning minors II. Discret. Math. 306(8-9): 762-778 (2006) - [j34]Roland Häggkvist, Klas Markström:
Cycle double covers and spanning minors I. J. Comb. Theory B 96(2): 183-206 (2006) - 2005
- [j33]Roland Häggkvist, Sean McGuinness:
Double covers of cubic graphs with oddness 4. J. Comb. Theory B 93(2): 251-277 (2005) - 2004
- [j32]Roland Häggkvist, Robert Johansson
:
A note on edge-decompositions of planar graphs. Discret. Math. 283(1-3): 263-266 (2004) - 2002
- [j31]Roland Häggkvist, Wolfgang Mader:
Circuits through prescribed vertices in k-connected k-regular graphs. J. Graph Theory 39(2): 145-163 (2002) - 2000
- [j30]Tristan Denley, Roland Häggkvist:
Completing some Partial Latin Squares. Eur. J. Comb. 21(7): 877-880 (2000)
1990 – 1999
- 1998
- [j29]Roland Häggkvist, Guoping Jin:
Graphs with Odd Girth at Least Seven and High Minimum Degree. Graphs Comb. 14(4): 351-362 (1998) - 1997
- [j28]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): 295-313 (1997) - 1996
- [j27]Amanda G. Chetwynd
An Improvement of Hind's Upper Bound on the Total Chromatic Number. Comb. Probab. Comput. 5: 94-104 (1996) - [j26]Roland Häggkvist:
Restricted Edge-colourings of Bipartite Graphs. Comb. Probab. Comput. 5: 385-392 (1996) - [j25]Roland Häggkvist, Jeannette C. M. Janssen
All-even latin squares. Discret. Math. 157(1-3): 199-206 (1996) - [j24]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): 95-103 (1996) - 1995
- [j23]Roland Häggkvist, Andrew Thomason:
Oriented hamilton cycles in digraphs. J. Graph Theory 19(4): 471-479 (1995) - 1994
- [j22]Roland Häggkvist, Anders Johansson:
(1, 2)-Factorizations of General Eulerian Nearly Regular Graphs. Comb. Probab. Comput. 3: 87-95 (1994) - [j21]Genghua Fan, Roland Häggkvist:
The Square of a Hamiltonian Cycle. SIAM J. Discret. Math. 7(2): 203-212 (1994) - 1993
- [j20]Roland Häggkvist:
Hamilton Cycles in Oriented Graphs. Comb. Probab. Comput. 2: 25-32 (1993) - [j19]Roland Häggkvist, Pavol Hell:
Universality of A-mote Graphs. Eur. J. Comb. 14(1): 23-27 (1993) - 1992
- [j18]Roland Häggkvist:
On the structure of Non-Hamiltonian Graphs 1. Comb. Probab. Comput. 1: 27-34 (1992) - [j17]Roland Häggkvist, Amanda G. Chetwynd
Some upper bounds on the total and list chromatic numbers of multigraphs. J. Graph Theory 16(5): 503-516 (1992) - 1991
- [j16]Roland Häggkvist, Andrew Thomason:
Trees in tournaments. Comb. 11(2): 123-130 (1991) - 1990
- [j15]Béla Bollobás, Roland Häggkvist:
Powers of Hamilton cycles in tournaments. J. Comb. Theory B 50(2): 309-318 (1990)
1980 – 1989
- 1989
- [j14]Roland Häggkvist, Yannis Manoussakis:
Cicles and paths in bipartite tournaments with spanning configurations. Comb. 9(1): 33-38 (1989) - [j13]Roland Häggkvist:
On the path-complete bipartite Ramsey number. Discret. Math. 75(1-3): 243-245 (1989) - [j12]Roland Häggkvist:
Towards a solution of the dinitz problem? Discret. Math. 75(1-3): 247-251 (1989) - [j11]Roland Häggkvist:
A note on latin squares with restricted support. Discret. Math. 75(1-3): 253-254 (1989) - [j10]Amanda G. Chetwynd
A note on list-colorings. J. Graph Theory 13(1): 87-95 (1989) - 1988
- [j9]Roland Häggkvist, Pavol Hell, Donald J. Miller, Victor Neumann-Lara:
On multiplicative graphs and the product conjecture. Comb. 8(1): 63-74 (1988) - 1985
- [j8]Brian Alspach, Roland Häggkvist:
Some observations on the oberwolfach problem. J. Graph Theory 9(1): 177-187 (1985) - 1983
- [j7]Roland Häggkvist, Per Olov Lindberg, B. Lindström:
Dissecting a square into rectangles of equal area. Discret. Math. 47: 321-323 (1983) - [j6]Jerrold W. Grossman, Roland Häggkvist:
Alternating cycles in edge-partitioned graphs. J. Comb. Theory B 34(1): 77-81 (1983) - 1982
- [j5]Roland Häggkvist, Carsten Thomassen:
Circuits through specified edges. Discret. Math. 41(1): 29-34 (1982) - 1981
- [j4]Roland Häggkvist, G. G. Nicoghossian:
A remark on Hamiltonian cycles. J. Comb. Theory B 30(1): 118-120 (1981) - [j3]Roland Häggkvist, Pavol Hell:
Parallel Sorting with Constant Time for Comparisons. SIAM J. Comput. 10(3): 465-472 (1981) - 1980
- [j2]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): 5-7 (1980)
1970 – 1979
- 1979
- [j1]Louis Caccetta, Roland Häggkvist:
On diameter critical graphs. Discret. Math. 28(3): 223-229 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: