default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJochen Harant
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j66]Thomas Böhme, Jochen Harant, Matthias Kriesell
, Samuel Mohr, Jens M. Schmidt:
Rooted minors and locally spanning subgraphs. J. Graph Theory 105(2): 209-229 (2024)- 2023
- [j65]Jochen Harant, Samuel Mohr:
New bounds on domination and independence in graphs. Discuss. Math. Graph Theory 43(3): 809-824 (2023) - 2022
- [i3]Christoph Brause, Jochen Harant, Florian Hörsch, Samuel Mohr:
Spanning trees of smallest maximum degree in subdivisions of graphs. CoRR abs/2210.04669 (2022) - 2021
- [j64]Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt:
Circumference of essentially 4-connected planar triangulations. J. Graph Algorithms Appl. 25(1): 121-132 (2021) - 2020
- [j63]Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt:
Longer cycles in essentially 4-connected planar graphs. Discuss. Math. Graph Theory 40(1): 269-277 (2020) - [j62]Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt:
On the Circumference of Essentially 4-connected Planar Graphs. J. Graph Algorithms Appl. 24(1): 21-46 (2020) - [j61]Igor Fabrici, Jochen Harant, Tomás Madaras, Samuel Mohr, Roman Soták, Carol T. Zamfirescu:
Long cycles and spanning subgraphs of locally maximal 1-planar graphs. J. Graph Theory 95(1): 125-137 (2020)
2010 – 2019
- 2019
- [j60]Jochen Harant, Samuel Mohr:
On Selkow's bound on the independence number of graphs. Discuss. Math. Graph Theory 39(3): 655-657 (2019) - 2018
- [i2]Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt:
Even Longer Cycles in Essentially 4-Connected Planar Graphs. CoRR abs/1806.09413 (2018) - 2017
- [j59]Thomas Böhme, Jochen Harant, Matthias Kriesell, Michael Stiebitz:
Horst Sachs (1927-2016). Discret. Math. 340(11): 2615 (2017) - [i1]Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt:
Longer Cycles in Essentially 4-Connected Planar Graphs. CoRR abs/1710.05619 (2017) - 2016
- [j58]Maria Axenovich, Jochen Harant, Jakub Przybylo, Roman Soták, Margit Voigt, Jenny Weidelich:
A note on adjacent vertex distinguishing colorings of graphs. Discret. Appl. Math. 205: 1-7 (2016) - [j57]Jochen Harant, Samuel Mohr:
Maximum weighted induced subgraphs. Discret. Math. 339(7): 1954-1959 (2016) - [j56]Igor Fabrici, Jochen Harant, Stanislav Jendrol':
On longest cycles in essentially 4-connected planar graphs. Discuss. Math. Graph Theory 36(3): 565-575 (2016) - [j55]Jochen Harant, Arnfried Kemnitz:
Lower bounds on the sum choice number of a graph. Electron. Notes Discret. Math. 53: 421-431 (2016) - [j54]Jochen Harant, Igor Fabrici, Stanislav Jendrol':
On Longest Cycles in Essentially 4-connected Planar Graphs. Electron. Notes Discret. Math. 55: 143-146 (2016) - 2015
- [j53]Jochen Harant, Sebastian Richter:
A new eigenvalue bound for independent sets. Discret. Math. 338(10): 1763-1765 (2015) - [j52]Jochen Harant, Julia Niebling, Sebastian Richter:
Eigenvalue conditions for induced subgraphs. Discuss. Math. Graph Theory 35(2): 355-363 (2015) - 2014
- [j51]Július Czap, Jochen Harant, Dávid Hudák:
An upper bound on the sum of powers of the degrees of simple 1-planar graphs. Discret. Appl. Math. 165: 146-151 (2014) - [j50]Stephan Brandt, Jochen Harant, Steffi Naumann:
On degree sums of a triangle-free graph. Discret. Math. 337: 76-82 (2014) - [j49]Igor Fabrici, Jochen Harant, Stanislav Jendrol', Roman Soták:
A note on vertex colorings of plane graphs. Discuss. Math. Graph Theory 34(4): 849-855 (2014) - 2013
- [j48]Frank Göring, Jochen Harant:
Prescribed edges and forbidden edges for a cycle in a planar graph. Discret. Appl. Math. 161(12): 1734-1738 (2013) - [j47]Jochen Harant:
A note on Barnette's Conjecture. Discuss. Math. Graph Theory 33(1): 133-137 (2013) - 2012
- [j46]Jochen Harant, Stanislav Jendrol':
Nonrepetitive vertex colorings of graphs. Discret. Math. 312(2): 374-380 (2012) - [j45]Jochen Harant, Arnfried Kemnitz, Akira Saito, Ingo Schiermeyer:
Closures, cycles, and paths. J. Graph Theory 69(3): 314-323 (2012) - [j44]Piotr Borowiecki, Frank Göring, Jochen Harant, Dieter Rautenbach:
The potential of greed for independence. J. Graph Theory 71(3): 245-259 (2012) - 2011
- [j43]Jochen Harant, Dieter Rautenbach:
Independence in connected graphs. Discret. Appl. Math. 159(1): 79-86 (2011) - [j42]Jochen Harant:
A lower bound on independence in terms of degrees. Discret. Appl. Math. 159(10): 966-970 (2011) - [j41]Jochen Harant, Stanislav Jendrol', Tomás Madaras:
Upper bounds on the sum of powers of the degrees of a simple planar graph. J. Graph Theory 67(2): 112-123 (2011) - 2010
- [j40]Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer:
Random Procedures for Dominating Sets in Graphs. Electron. J. Comb. 17(1) (2010) - [j39]Jochen Harant, Dieter Rautenbach, Peter Recht, Friedrich Regen:
Packing edge-disjoint cycles in graphs and the cyclomatic number. Discret. Math. 310(9): 1456-1462 (2010) - [j38]Frank Göring, Jochen Harant:
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs. Discret. Math. 310(9): 1491-1494 (2010) - [j37]Jochen Harant, Dieter Rautenbach, Peter Recht, Ingo Schiermeyer, Eva-Maria Sprengel:
Packing disjoint cycles over vertex cuts. Discret. Math. 310(13-14): 1974-1978 (2010) - [j36]Sarah Artmann, Jochen Harant:
Random procedures for dominating sets in bipartite graphs. Discuss. Math. Graph Theory 30(2): 277-288 (2010) - [c2]Jochen Harant:
On Hamiltonian Cycles through Prescribed Edges of a Planar Graph. CTW 2010: 79-82
2000 – 2009
- 2009
- [j35]Jochen Harant, Dieter Rautenbach:
Domination in bipartite graphs. Discret. Math. 309(1): 113-122 (2009) - [j34]Jochen Harant, Stefan Senitsch:
A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs. Discret. Math. 309(15): 4949-4951 (2009) - [j33]Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer:
On F-independence in graphs. Discuss. Math. Graph Theory 29(2): 377-383 (2009) - 2008
- [j32]Jochen Harant, Michael A. Henning, Dieter Rautenbach, Ingo Schiermeyer:
The independence number in graphs of maximum degree three. Discret. Math. 308(23): 5829-5833 (2008) - [j31]Igor Fabrici, Jochen Harant, Stanislav Jendrol':
Paths of low weight in planar graphs. Discuss. Math. Graph Theory 28(1): 121-135 (2008) - [j30]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) - [c1]Frank Göring, Jochen Harant:
Locally Dense Independent Sets in Regular Graphs of Large Girth - An Example of a New Approach. Bonn Workshop of Combinatorial Optimization 2008: 163-183 - 2007
- [j29]Tobias Gerlach, Jochen Harant:
On a cycle through a specified linear forest of a graph. Discret. Math. 307(7-8): 892-895 (2007) - [j28]Jochen Harant, Stanislav Jendrol':
On the Existence of Specific Stars in Planar Graphs. Graphs Comb. 23(5): 529-543 (2007) - 2006
- [j27]Tobias Gerlach, Frank Göring, Jochen Harant, Michal Tkác:
On cycles through specified vertices. Discret. Math. 306(8-9): 831-835 (2006) - [j26]Jochen Harant, Ingo Schiermeyer:
A lower bound on the independence number of a graph in terms of degrees. Discuss. Math. Graph Theory 26(3): 431-437 (2006) - 2005
- [j25]Frank Göring, Jochen Harant:
On Domination in Graphs. Discuss. Math. Graph Theory 25(1-2): 7-12 (2005) - [j24]Jochen Harant, Michael A. Henning:
On Double Domination in Graphs. Discuss. Math. Graph Theory 25(1-2): 29-34 (2005) - 2004
- [j23]Frank Göring, Jochen Harant, Erhard Hexel, Zsolt Tuza:
On short cycles through prescribed vertices of a graph. Discret. Math. 286(1-2): 67-74 (2004) - [j22]Jochen Harant:
On paths and cycles through specified vertices. Discret. Math. 286(1-2): 95-98 (2004) - 2002
- [j21]Jochen Harant, Zdenek Ryjácek, Ingo Schiermeyer:
Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set. Discret. Math. 256(1-2): 193-201 (2002) - [j20]Jochen Harant, Ingo Schiermeyer, Margit Voigt:
Preface. Discuss. Math. Graph Theory 22(1): 5-6 (2002) - [j19]Tobias Gerlach, Jochen Harant:
A note on domination in bipartite graphs. Discuss. Math. Graph Theory 22(2): 229-231 (2002) - 2001
- [j18]Jochen Harant, Ingo Schiermeyer:
On the independence number of a graph in terms of order and size. Discret. Math. 232(1-3): 131-138 (2001) - [j17]Jochen Harant, Mirko Hornák, Zdzislaw Skupien:
Separating 3-cycles in plane triangulations. Discret. Math. 239(1-3): 127-136 (2001) - [j16]Jochen Harant, Margit Voigt, Stanislav Jendrol', Bert Randerath, Zdenek Ryjácek, Ingo Schiermeyer:
On weights of induced paths and cycles in claw-free and K1, r-free graphs. J. Graph Theory 36(3): 131-143 (2001) - [j15]Thomas Böhme, Frank Göring, Jochen Harant:
Menger's Theorem. J. Graph Theory 37(1): 35-36 (2001) - 2000
- [j14]Jochen Harant:
Some news about the independence number of a graph. Discuss. Math. Graph Theory 20(1): 71-79 (2000)
1990 – 1999
- 1999
- [j13]Jochen Harant, Anja Pruchnewski, Margit Voigt:
On Dominating Sets And Independent Sets Of Graphs. Comb. Probab. Comput. 8(6): 547-553 (1999) - [j12]Jochen Harant, Stanislav Jendrol', Michal Tkác:
On 3-Connected Plane Graphs without Triangular Faces. J. Comb. Theory B 77(1): 150-161 (1999) - [j11]Thomas Böhme, Jochen Harant, Michal Tkác:
On certain Hamiltonian cycles in planar graphs. J. Graph Theory 32(1): 81-96 (1999) - [j10]Thomas Böhme, Jochen Harant, Michal Tkác:
More than one tough chordal planar graphs are Hamiltonian. J. Graph Theory 32(4): 405-410 (1999) - 1998
- [j9]Jochen Harant:
A lower bound on the independence number of a graph. Discret. Math. 188(1-3): 239-243 (1998) - [j8]Thomas Böhme, Jochen Harant:
On Hamiltonian cycles in 4- and 5-connected plane triangulations. Discret. Math. 191(1-3): 25-30 (1998) - [j7]Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer:
A planarity criterion for cubic bipartite graphs. Discret. Math. 191(1-3): 31-43 (1998) - 1996
- [j6]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) - 1995
- [j5]Jochen Harant, Peter J. Owens:
Non-hamiltonian 4/5-tough maximal planar graphs. Discret. Math. 147(1-3): 301-305 (1995) - 1994
- [j4]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) - 1993
- [j3]Jochen Harant:
Toughness and nonhamiltonicity of polyhedral graphs. Discret. Math. 113(1-3): 249-253 (1993) - [j2]Jochen Harant:
An upper bound for the radius of a 3-connected graph. Discret. Math. 122(1-3): 335-341 (1993)
1980 – 1989
- 1981
- [j1]Jochen Harant, Hansjoachim Walther:
On the radius of graphs. J. Comb. Theory B 30(1): 113-117 (1981)
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-06-10 21:21 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:
