Jochen Harant

71 papers C 1Journal 69Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
Rooted minors and locally spanning subgraphs.
J. Graph Theory
Thomas Böhme, Jochen Harant, Matthias Kriesell, Samuel Mohr, Jens M. Schmidt
2023 J jnl
New bounds on domination and independence in graphs.
Discuss. Math. Graph Theory
Jochen Harant, Samuel Mohr
2022 J jnl
Spanning trees of smallest maximum degree in subdivisions of graphs.
CoRR
Christoph Brause, Jochen Harant, Florian Hörsch, Samuel Mohr
2021 J jnl
Circumference of essentially 4-connected planar triangulations.
J. Graph Algorithms Appl.
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2020 J jnl
Long cycles and spanning subgraphs of locally maximal 1-planar graphs.
J. Graph Theory
Igor Fabrici, Jochen Harant, Tomás Madaras, Samuel Mohr, Roman Soták, Carol T. Zamfirescu
2020 J jnl
Longer cycles in essentially 4-connected planar graphs.
Discuss. Math. Graph Theory
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2020 J jnl
On the Circumference of Essentially 4-connected Planar Graphs.
J. Graph Algorithms Appl.
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2019 J jnl
On Selkow's bound on the independence number of graphs.
Discuss. Math. Graph Theory
Jochen Harant, Samuel Mohr
2018 J jnl
Even Longer Cycles in Essentially 4-Connected Planar Graphs.
CoRR
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2017 J jnl
Horst Sachs (1927-2016).
Discret. Math.
Thomas Böhme, Jochen Harant, Matthias Kriesell, Michael Stiebitz
2017 J jnl
Longer Cycles in Essentially 4-Connected Planar Graphs.
CoRR
Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt
2016 J jnl
A note on adjacent vertex distinguishing colorings of graphs.
Discret. Appl. Math.
Maria Axenovich, Jochen Harant, Jakub Przybylo, Roman Soták, Margit Voigt, Jenny Weidelich
2016 J jnl
Lower bounds on the sum choice number of a graph.
Electron. Notes Discret. Math.
Jochen Harant, Arnfried Kemnitz
2016 J jnl
Maximum weighted induced subgraphs.
Discret. Math.
Jochen Harant, Samuel Mohr
2016 J jnl
On Longest Cycles in Essentially 4-connected Planar Graphs.
Electron. Notes Discret. Math.
Jochen Harant, Igor Fabrici, Stanislav Jendrol'
2016 J jnl
On longest cycles in essentially 4-connected planar graphs.
Discuss. Math. Graph Theory
Igor Fabrici, Jochen Harant, Stanislav Jendrol'
2015 J jnl
A new eigenvalue bound for independent sets.
Discret. Math.
Jochen Harant, Sebastian Richter
2015 J jnl
Eigenvalue conditions for induced subgraphs.
Discuss. Math. Graph Theory
Jochen Harant, Julia Niebling, Sebastian Richter
2014 J jnl
A note on vertex colorings of plane graphs.
Discuss. Math. Graph Theory
Igor Fabrici, Jochen Harant, Stanislav Jendrol', Roman Soták
2014 J jnl
An upper bound on the sum of powers of the degrees of simple 1-planar graphs.
Discret. Appl. Math.
Július Czap, Jochen Harant, Dávid Hudák
2014 J jnl
On degree sums of a triangle-free graph.
Discret. Math.
Stephan Brandt, Jochen Harant, Steffi Naumann
2013 J jnl
A note on Barnette's Conjecture.
Discuss. Math. Graph Theory
Jochen Harant
2013 J jnl
Prescribed edges and forbidden edges for a cycle in a planar graph.
Discret. Appl. Math.
Frank Göring, Jochen Harant
2012 J jnl
Closures, cycles, and paths.
J. Graph Theory
Jochen Harant, Arnfried Kemnitz, Akira Saito, Ingo Schiermeyer
2012 J jnl
Nonrepetitive vertex colorings of graphs.
Discret. Math.
Jochen Harant, Stanislav Jendrol'
2012 J jnl
The potential of greed for independence.
J. Graph Theory
Piotr Borowiecki, Frank Göring, Jochen Harant, Dieter Rautenbach
2011 J jnl
A lower bound on independence in terms of degrees.
Discret. Appl. Math.
Jochen Harant
2011 J jnl
Independence in connected graphs.
Discret. Appl. Math.
Jochen Harant, Dieter Rautenbach
2011 J jnl
Upper bounds on the sum of powers of the degrees of a simple planar graph.
J. Graph Theory
Jochen Harant, Stanislav Jendrol', Tomás Madaras
2010 J jnl
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs.
Discret. Math.
Frank Göring, Jochen Harant
2010 C conf
On Hamiltonian Cycles through Prescribed Edges of a Planar Graph.
CTW
Jochen Harant
2010 J jnl
Packing disjoint cycles over vertex cuts.
Discret. Math.
Jochen Harant, Dieter Rautenbach, Peter Recht, Ingo Schiermeyer, Eva-Maria Sprengel
2010 J jnl
Packing edge-disjoint cycles in graphs and the cyclomatic number.
Discret. Math.
Jochen Harant, Dieter Rautenbach, Peter Recht, Friedrich Regen
2010 J jnl
Random Procedures for Dominating Sets in Graphs.
Electron. J. Comb.
Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer
2010 J jnl
Random procedures for dominating sets in bipartite graphs.
Discuss. Math. Graph Theory
Sarah Artmann, Jochen Harant
2009 J jnl
A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs.
Discret. Math.
Jochen Harant, Stefan Senitsch
2009 J jnl
Domination in bipartite graphs.
Discret. Math.
Jochen Harant, Dieter Rautenbach
2009 J jnl
On
Discuss. Math. Graph Theory
Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer
2008 — conf
Locally Dense Independent Sets in Regular Graphs of Large Girth - An Example of a New Approach.
Bonn Workshop of Combinatorial Optimization
Frank Göring, Jochen Harant
2008 J jnl
On long cycles through four prescribed vertices of a polyhedral graph.
Discuss. Math. Graph Theory
Jochen Harant, Stanislav Jendrol', Hansjoachim Walther
2008 J jnl
Paths of low weight in planar graphs.
Discuss. Math. Graph Theory
Igor Fabrici, Jochen Harant, Stanislav Jendrol'
2008 J jnl
The independence number in graphs of maximum degree three.
Discret. Math.
Jochen Harant, Michael A. Henning, Dieter Rautenbach, Ingo Schiermeyer
2007 J jnl
On a cycle through a specified linear forest of a graph.
Discret. Math.
Tobias Gerlach, Jochen Harant
2007 J jnl
On the Existence of Specific Stars in Planar Graphs.
Graphs Comb.
Jochen Harant, Stanislav Jendrol'
2006 J jnl
A lower bound on the independence number of a graph in terms of degrees.
Discuss. Math. Graph Theory
Jochen Harant, Ingo Schiermeyer
2006 J jnl
On cycles through specified vertices.
Discret. Math.
Tobias Gerlach, Frank Göring, Jochen Harant, Michal Tkác
2005 J jnl
On Domination in Graphs.
Discuss. Math. Graph Theory
Frank Göring, Jochen Harant
2005 J jnl
On Double Domination in Graphs.
Discuss. Math. Graph Theory
Jochen Harant, Michael A. Henning
2004 J jnl
On paths and cycles through specified vertices.
Discret. Math.
Jochen Harant
2004 J jnl
On short cycles through prescribed vertices of a graph.
Discret. Math.
Frank Göring, Jochen Harant, Erhard Hexel, Zsolt Tuza
2002 J jnl
A note on domination in bipartite graphs.
Discuss. Math. Graph Theory
Tobias Gerlach, Jochen Harant
2002 J jnl
Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set.
Discret. Math.
Jochen Harant, Zdenek Ryjácek, Ingo Schiermeyer
2002 J jnl
Preface.
Discuss. Math. Graph Theory
Jochen Harant, Ingo Schiermeyer, Margit Voigt
2001 J jnl
Menger's Theorem.
J. Graph Theory
Thomas Böhme, Frank Göring, Jochen Harant
2001 J jnl
On the independence number of a graph in terms of order and size.
Discret. Math.
Jochen Harant, Ingo Schiermeyer
2001 J jnl
On weights of induced paths and cycles in claw-free and
J. Graph Theory
Jochen Harant, Margit Voigt, Stanislav Jendrol', Bert Randerath, Zdenek Ryjácek, Ingo Schiermeyer
2001 J jnl
Separating 3-cycles in plane triangulations.
Discret. Math.
Jochen Harant, Mirko Hornák, Zdzislaw Skupien
2000 J jnl
Some news about the independence number of a graph.
Discuss. Math. Graph Theory
Jochen Harant
1999 J jnl
More than one tough chordal planar graphs are Hamiltonian.
J. Graph Theory
Thomas Böhme, Jochen Harant, Michal Tkác
1999 J jnl
On 3-Connected Plane Graphs without Triangular Faces.
J. Comb. Theory B
Jochen Harant, Stanislav Jendrol', Michal Tkác
1999 J jnl
On Dominating Sets And Independent Sets Of Graphs.
Comb. Probab. Comput.
Jochen Harant, Anja Pruchnewski, Margit Voigt
1999 J jnl
On certain Hamiltonian cycles in planar graphs.
J. Graph Theory
Thomas Böhme, Jochen Harant, Michal Tkác
1998 J jnl
A lower bound on the independence number of a graph.
Discret. Math.
Jochen Harant
1998 J jnl
A planarity criterion for cubic bipartite graphs.
Discret. Math.
Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer
1998 J jnl
On Hamiltonian cycles in 4- and 5-connected plane triangulations.
Discret. Math.
Thomas Böhme, Jochen Harant
1996 J jnl
5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one.
Discret. Math.
Jochen Harant, Peter J. Owens, Michal Tkác, Hansjoachim Walther
1995 J jnl
Non-hamiltonian 4/5-tough maximal planar graphs.
Discret. Math.
Jochen Harant, Peter J. Owens
1994 J jnl
A Lower Bound for the Shortness Coefficient of a Class of Graphs.
Discret. Appl. Math.
Jochen Harant, Hansjoachim Walther
1993 J jnl
An upper bound for the radius of a 3-connected graph.
Discret. Math.
Jochen Harant
1993 J jnl
Toughness and nonhamiltonicity of polyhedral graphs.
Discret. Math.
Jochen Harant
1981 J jnl
On the radius of graphs.
J. Comb. Theory B
Jochen Harant, Hansjoachim Walther