Jochen Harant

Publication Activity (10 Years)

Years Active: 1981-2024
Publications (10 Years): 16

Top Topics

Gallium Arsenide

Top Venues

Discuss. Math. Graph Theory

Discret. Appl. Math.

Publications

Thomas Böhme, Jochen Harant, Matthias Kriesell, Samuel Mohr, Jens M. Schmidt
Rooted minors and locally spanning subgraphs. J. Graph Theory 105 (2) (2024)
Jochen Harant, Samuel Mohr
New bounds on domination and independence in graphs. Discuss. Math. Graph Theory 43 (3) (2023)
Christoph Brause, Jochen Harant, Florian Hörsch, Samuel Mohr
Spanning trees of smallest maximum degree in subdivisions of graphs. CoRR (2022)
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
Circumference of essentially 4-connected planar triangulations. J. Graph Algorithms Appl. 25 (1) (2021)
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
Longer cycles in essentially 4-connected planar graphs. Discuss. Math. Graph Theory 40 (1) (2020)
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
On the Circumference of Essentially 4-connected Planar Graphs. J. Graph Algorithms Appl. 24 (1) (2020)
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) (2020)
Jochen Harant, Samuel Mohr
On Selkow's bound on the independence number of graphs. Discuss. Math. Graph Theory 39 (3) (2019)
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
Even Longer Cycles in Essentially 4-Connected Planar Graphs. CoRR (2018)
Thomas Böhme, Jochen Harant, Matthias Kriesell, Michael Stiebitz
Horst Sachs (1927-2016). Discret. Math. 340 (11) (2017)
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
Longer Cycles in Essentially 4-Connected Planar Graphs. CoRR (2017)
Jochen Harant, Samuel Mohr
Maximum weighted induced subgraphs. Discret. Math. 339 (7) (2016)
Jochen Harant, Arnfried Kemnitz
Lower bounds on the sum choice number of a graph. Electron. Notes Discret. Math. 53 (2016)
Jochen Harant, Igor Fabrici, Stanislav Jendrol'
On Longest Cycles in Essentially 4-connected Planar Graphs. Electron. Notes Discret. Math. 55 (2016)
Igor Fabrici, Jochen Harant, Stanislav Jendrol'
On longest cycles in essentially 4-connected planar graphs. Discuss. Math. Graph Theory 36 (3) (2016)
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 (2016)
Jochen Harant, Julia Niebling, Sebastian Richter
Eigenvalue conditions for induced subgraphs. Discuss. Math. Graph Theory 35 (2) (2015)
Jochen Harant, Sebastian Richter
A new eigenvalue bound for independent sets. Discret. Math. 338 (10) (2015)
Stephan Brandt, Jochen Harant, Steffi Naumann
On degree sums of a triangle-free graph. Discret. Math. 337 (2014)
Igor Fabrici, Jochen Harant, Stanislav Jendrol', Roman Soták
A note on vertex colorings of plane graphs. Discuss. Math. Graph Theory 34 (4) (2014)
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 (2014)
Frank Göring, Jochen Harant
Prescribed edges and forbidden edges for a cycle in a planar graph. Discret. Appl. Math. 161 (12) (2013)
Jochen Harant
A note on Barnette's Conjecture. Discuss. Math. Graph Theory 33 (1) (2013)
Jochen Harant, Stanislav Jendrol'
Nonrepetitive vertex colorings of graphs. Discret. Math. 312 (2) (2012)
Jochen Harant, Arnfried Kemnitz, Akira Saito, Ingo Schiermeyer
Closures, cycles, and paths. J. Graph Theory 69 (3) (2012)
Piotr Borowiecki, Frank Göring, Jochen Harant, Dieter Rautenbach
The potential of greed for independence. J. Graph Theory 71 (3) (2012)
Jochen Harant, Dieter Rautenbach
Independence in connected graphs. Discret. Appl. Math. 159 (1) (2011)
Jochen Harant
A lower bound on independence in terms of degrees. Discret. Appl. Math. 159 (10) (2011)
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) (2011)
Jochen Harant, Dieter Rautenbach, Peter Recht, Friedrich Regen
Packing edge-disjoint cycles in graphs and the cyclomatic number. Discret. Math. 310 (9) (2010)
Frank Göring, Jochen Harant
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs. Discret. Math. 310 (9) (2010)
Jochen Harant
On Hamiltonian Cycles through Prescribed Edges of a Planar Graph. CTW (2010)
Jochen Harant, Dieter Rautenbach, Peter Recht, Ingo Schiermeyer, Eva-Maria Sprengel
Packing disjoint cycles over vertex cuts. Discret. Math. 310 (13-14) (2010)
Sarah Artmann, Jochen Harant
Random procedures for dominating sets in bipartite graphs. Discuss. Math. Graph Theory 30 (2) (2010)
Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer
Random Procedures for Dominating Sets in Graphs. Electron. J. Comb. 17 (1) (2010)
Jochen Harant, Dieter Rautenbach
Domination in bipartite graphs. Discret. Math. 309 (1) (2009)
Jochen Harant, Stefan Senitsch
A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs. Discret. Math. 309 (15) (2009)
Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer
-independence in graphs. Discuss. Math. Graph Theory 29 (2) (2009)
Jochen Harant, Michael A. Henning, Dieter Rautenbach, Ingo Schiermeyer
The independence number in graphs of maximum degree three. Discret. Math. 308 (23) (2008)
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)
Jochen Harant, Stanislav Jendrol', Hansjoachim Walther
On long cycles through four prescribed vertices of a polyhedral graph. Discuss. Math. Graph Theory 28 (3) (2008)
Igor Fabrici, Jochen Harant, Stanislav Jendrol'
Paths of low weight in planar graphs. Discuss. Math. Graph Theory 28 (1) (2008)
Jochen Harant, Stanislav Jendrol'
On the Existence of Specific Stars in Planar Graphs. Graphs Comb. 23 (5) (2007)
Tobias Gerlach, Jochen Harant
On a cycle through a specified linear forest of a graph. Discret. Math. 307 (7-8) (2007)
Tobias Gerlach, Frank Göring, Jochen Harant, Michal Tkác
On cycles through specified vertices. Discret. Math. 306 (8-9) (2006)
Jochen Harant, Ingo Schiermeyer
A lower bound on the independence number of a graph in terms of degrees. Discuss. Math. Graph Theory 26 (3) (2006)
Jochen Harant, Michael A. Henning
On Double Domination in Graphs. Discuss. Math. Graph Theory 25 (1-2) (2005)
Frank Göring, Jochen Harant
On Domination in Graphs. Discuss. Math. Graph Theory 25 (1-2) (2005)
Jochen Harant
On paths and cycles through specified vertices. Discret. Math. 286 (1-2) (2004)
Frank Göring, Jochen Harant, Erhard Hexel, Zsolt Tuza
On short cycles through prescribed vertices of a graph. Discret. Math. 286 (1-2) (2004)
Tobias Gerlach, Jochen Harant
A note on domination in bipartite graphs. Discuss. Math. Graph Theory 22 (2) (2002)
Jochen Harant, Ingo Schiermeyer, Margit Voigt
Preface. Discuss. Math. Graph Theory 22 (1) (2002)
Jochen Harant, Zdenek Ryjácek, Ingo Schiermeyer
Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set. Discret. Math. 256 (1-2) (2002)
Thomas Böhme, Frank Göring, Jochen Harant
Menger's Theorem. J. Graph Theory 37 (1) (2001)
Jochen Harant, Margit Voigt, Stanislav Jendrol', Bert Randerath, Zdenek Ryjácek, Ingo Schiermeyer
-free graphs. J. Graph Theory 36 (3) (2001)
Jochen Harant, Mirko Hornák, Zdzislaw Skupien
Separating 3-cycles in plane triangulations. Discret. Math. 239 (1-3) (2001)
Jochen Harant, Ingo Schiermeyer
On the independence number of a graph in terms of order and size. Discret. Math. 232 (1-3) (2001)
Jochen Harant
Some news about the independence number of a graph. Discuss. Math. Graph Theory 20 (1) (2000)
Jochen Harant, Anja Pruchnewski, Margit Voigt
On Dominating Sets And Independent Sets Of Graphs. Comb. Probab. Comput. 8 (6) (1999)
Jochen Harant, Stanislav Jendrol', Michal Tkác
On 3-Connected Plane Graphs without Triangular Faces. J. Comb. Theory, Ser. B 77 (1) (1999)
Thomas Böhme, Jochen Harant, Michal Tkác
On certain Hamiltonian cycles in planar graphs. J. Graph Theory 32 (1) (1999)
Thomas Böhme, Jochen Harant, Michal Tkác
More than one tough chordal planar graphs are Hamiltonian. J. Graph Theory 32 (4) (1999)
Jochen Harant
A lower bound on the independence number of a graph. Discret. Math. 188 (1-3) (1998)
Thomas Böhme, Jochen Harant
On Hamiltonian cycles in 4- and 5-connected plane triangulations. Discret. Math. 191 (1-3) (1998)
Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer
A planarity criterion for cubic bipartite graphs. Discret. Math. 191 (1-3) (1998)
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) (1996)
Jochen Harant, Peter J. Owens
Non-hamiltonian 4/5-tough maximal planar graphs. Discret. Math. 147 (1-3) (1995)
Jochen Harant, Hansjoachim Walther
A Lower Bound for the Shortness Coefficient of a Class of Graphs. Discret. Appl. Math. 51 (1-2) (1994)
Jochen Harant
Toughness and nonhamiltonicity of polyhedral graphs. Discret. Math. 113 (1-3) (1993)
Jochen Harant
An upper bound for the radius of a 3-connected graph. Discret. Math. 122 (1-3) (1993)
Jochen Harant, Hansjoachim Walther
On the radius of graphs. J. Comb. Theory, Ser. B 30 (1) (1981)