default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHeiko Harborth
Person information
- affiliation: Technical University of Braunschweig, Germany
- award (2007): Euler Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j33]Chula J. Jayawardene, Cecil C. Rousseau, Heiko Harborth:
On Path Convex Ramsey Numbers. J. Graph Theory 86(3): 286-294 (2017)- 2013
- [j32]Jens-P. Bode, Heiko Harborth:
The minimum size of kk-rainbow connected graphs of given order. Discret. Math. 313(19): 1924-1928 (2013)
2000 – 2009
- 2009
- [j31]Matthew Alpert, Elie Feder, Heiko Harborth:
The Maximum of the Maximum Rectilinear Crossing Numbers of d-Regular Graphs of Order n. Electron. J. Comb. 16(1) (2009) - 2007
- [j30]Maria Axenovich, Heiko Harborth, Arnfried Kemnitz, Meinhard Möller, Ingo Schiermeyer:
Rainbows in the Hypercube. Graphs Comb. 23(2): 123-133 (2007) - 2005
- [j29]Jens-P. Bode, Hans-Dietrich O. F. Gronau, Heiko Harborth:
Some Ramsey Schur Numbers. Comb. Probab. Comput. 14(1-2): 25-30 (2005) - [j28]Jens-P. Bode, Heiko Harborth:
Directed paths of diagonals within polygons. Discret. Math. 299(1-3): 3-10 (2005) - 2003
- [j27]Jens-P. Bode, Heiko Harborth, Martin Harborth:
King independence on triangle boards. Discret. Math. 266(1-3): 101-107 (2003) - [j26]Jens-P. Bode, Heiko Harborth:
Independence for knights on hexagon and triangle boards. Discret. Math. 272(1): 27-35 (2003) - 2002
- [j25]Heiko Harborth:
Special numbers of crossings for complete graphs. Discret. Math. 244(1-3): 95-102 (2002) - 2001
- [j24]Heiko Harborth:
Eulerian straight ahead cycles in drawings of complete bipartite graphs. Discret. Math. 230(1-3): 45-48 (2001) - [j23]Heiko Harborth, Ingrid Mengersen:
Ramsey numbers in octahedron graphs. Discret. Math. 231(1-3): 241-246 (2001) - [j22]Heiko Harborth, Christian Thürmann:
Smallest limited snakes in d-grids. Discret. Math. 236(1-3): 145-149 (2001) - [j21]Arnfried Kemnitz, Heiko Harborth:
Plane integral drawings of planar graphs. Discret. Math. 236(1-3): 191-195 (2001) - 2000
- [j20]Jens-P. Bode, Heiko Harborth:
Hexagonal polyomino achievement. Discret. Math. 212(1-2): 5-18 (2000) - [j19]Heiko Harborth, Hanno Lefmann:
Coloring arcs of convex sets. Discret. Math. 220(1-3): 107-117 (2000)
1990 – 1999
- 1999
- [j18]Heiko Harborth, Meinhard Möller:
Weakened Ramsey Numbers. Discret. Appl. Math. 95(1-3): 279-284 (1999) - [j17]Heiko Harborth, Silke Maasberg:
All two-color Rado numbers for a(x + y) = bz. Discret. Math. 197-198: 397-407 (1999) - 1998
- [j16]Heiko Harborth:
Empty triangles in drawings of the complete graph. Discret. Math. 191(1-3): 109-111 (1998) - 1997
- [j15]Heiko Harborth, Silke Maasberg:
Rado Numbers fora(x+y)=bz. J. Comb. Theory A 80(2): 356-363 (1997) - 1996
- [j14]Heiko Harborth, Lothar Piepmeyer:
Zero-Sum Ramsey Numbers modulo 3. J. Comb. Theory A 75(1): 145-147 (1996) - 1995
- [j13]Heiko Harborth, Ingrid Mengersen, Richard H. Schelp:
The drawing Ramsey number Dr(Kn). Australas. J Comb. 11: 151-156 (1995) - [j12]Peter Brass
, Heiko Harborth, Hauke Nienborg:
On the maximum number of edges in a c4-free subgraph of qn. J. Graph Theory 19(1): 17-23 (1995) - 1994
- [j11]Holger Brandes, Heiko Harborth, Hans-Dietrich O. F. Gronau, Christian Schwahn:
Ramsey numbers for sets of small graphs. Discret. Math. 125(1-3): 73-86 (1994) - 1993
- [j10]Heiko Harborth, Arnfried Kemnitz, Meinhard Möller:
An Upper Bound for the Minimum Diameter of Integral Point Sets. Discret. Comput. Geom. 9: 427-432 (1993) - 1991
- [j9]Heiko Harborth, Hartmut Weiss:
Minimum sets of partial polyominoes. Australas. J Comb. 4: 261-268 (1991) - [j8]Heiko Harborth:
Plane four-regular graphs with vertex-to-vertex unit triangles. Discret. Math. 97(1-3): 219-222 (1991) - 1990
- [c1]Heiko Harborth, Lothar Piepmeyer:
Points Sets with Small Integral Distances. Applied Geometry And Discrete Mathematics 1990: 319-324
1980 – 1989
- 1989
- [j7]Knut Dehnhardt, Heiko Harborth:
Universal tilings of the plane by 0-1-matrices. Discret. Math. 73(1-2): 65-70 (1989) - [j6]Heiko Harborth, Philipp Oertel, Thomas Prellberg:
No-three-in-line for seventeen and nineteen. Discret. Math. 73(1-2): 89-90 (1989) - [j5]Heiko Harborth, Ingrid Mengersen:
All Ramsey numbers for five vertices and seven or eight edges. Discret. Math. 73(1-2): 91-98 (1989) - [j4]C. R. J. Clapham, Geoffrey Exoo, Heiko Harborth, Ingrid Mengersen, J. Sheehan:
The ramsey number of k5 - e. J. Graph Theory 13(1): 7-15 (1989) - 1986
- [j3]Heiko Harborth, Ingrid Mengersen:
Point sets with many unit circles. Discret. Math. 60: 193-197 (1986) - 1985
- [j2]Heiko Harborth, Ingrid Mengersen:
An upper bound for the ramsey number r(K5 - e). J. Graph Theory 9(4): 483-485 (1985)
1970 – 1979
- 1972
- [j1]Heiko Harborth:
Solution of Steinhaus's Problem with Plus and Minus Signs. J. Comb. Theory A 12(2): 253-259 (1972)
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 2024-10-07 21:17 CEST 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:
