default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHansjoachim Walther
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j21]Jochen Harant, Stanislav Jendrol', Hansjoachim Walther:
On long cycles through four prescribed vertices of a polyhedral graph. Discuss. Math. Graph Theory 28(3): 441-451 (2008)- 2007
- [j20]Jens Schreyer, Hansjoachim Walther, Leonid S. Melnikov:
Vertex-oblique graphs. Discret. Math. 307(11-12): 1538-1544 (2007) - 2004
- [j19]Jens Schreyer, Hansjoachim Walther:
Edge-oblique polyhedral graphs. Discret. Appl. Math. 136(2-3): 315-327 (2004) - 2002
- [j18]Hansjoachim Walther:
Polyhedral graphs with extreme numbers of types of faces. Discret. Appl. Math. 120(1-3): 263-274 (2002) - [j17]Margit Voigt, Hansjoachim Walther:
Polyhedral graphs with restricted number of faces of the same type. Discret. Math. 244(1-3): 473-478 (2002) - [j16]Andrey A. Dobrynin
, Leonid S. Melnikov, Jens Schreyer, Hansjoachim Walther:
Some news about oblique graphs. Discuss. Math. Graph Theory 22(1): 39-50 (2002) - 2001
- [j15]Jens Schreyer, Hansjoachim Walther:
Edge-Oblique Polyhedral Graphs. Electron. Notes Discret. Math. 8: 90-93 (2001) - 2000
- [j14]Igor Fabrici, Erhard Hexel, Stanislav Jendrol', Hansjoachim Walther:
On vertex-degree restricted paths in polyhedral graphs. Discret. Math. 212(1-2): 61-73 (2000) - [j13]Igor Fabrici, Peter J. Owens, Hansjoachim Walther:
Non-hamiltonian polyhedral graphs with two types of faces. Discret. Math. 213(1-3): 105-113 (2000)
1990 – 1999
- 1999
- [j12]Hansjoachim Walther:
Polyhedral Graphs with Extreme Numbers of Types of Faces. Electron. Notes Discret. Math. 3: 205-207 (1999) - 1997
- [j11]Hansjoachim Walther:
Polyhedral Graphs Without Hamiltonian Cycles. Discret. Appl. Math. 79(1-3): 257-263 (1997) - 1996
- [j10]Jochen Harant, Peter J. Owens, Michal Tkác, Hansjoachim Walther:
5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one. Discret. Math. 150(1-3): 143-153 (1996) - [j9]Hansjoachim Walther:
A nonhamiltonian five-regular multitriangular polyhedral graph. Discret. Math. 150(1-3): 387-392 (1996) - 1995
- [j8]Peter J. Owens, Hansjoachim Walther:
Hamiltonicity in multitriangular graphs. Discuss. Math. Graph Theory 15(1): 77-88 (1995) - 1994
- [j7]Jochen Harant, Hansjoachim Walther:
A Lower Bound for the Shortness Coefficient of a Class of Graphs. Discret. Appl. Math. 51(1-2): 103-105 (1994) - [j6]Margit Voigt, Hansjoachim Walther:
Chromatic Number of Prime Distance Graphs. Discret. Appl. Math. 51(1-2): 197-209 (1994) - 1991
- [j5]Margit Voigt, Hansjoachim Walther:
On the chromatic number of special distance graphs. Discret. Math. 97(1-3): 395-397 (1991)
1980 – 1989
- 1981
- [j4]Hansjoachim Walther:
Note on two problems of J. Zaks concerning Hamiltonian 3-polytopes. Discret. Math. 33(1): 107-109 (1981) - [j3]Jochen Harant, Hansjoachim Walther:
On the radius of graphs. J. Comb. Theory B 30(1): 113-117 (1981)
1970 – 1979
- 1979
- [j2]Hansjoachim Walther:
Remark on a paper of J. Zaks. Discret. Math. 26(3): 297-301 (1979) - 1973
- [j1]Branko Grünbaum, Hansjoachim Walther:
Shortness Exponents of Families of Graphs. J. Comb. Theory A 14(3): 364-385 (1973)
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-21 00:15 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:
