Jochen Harant

According to our database, Jochen Harant authored at least 69 papers between 1981 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Rooted minors and locally spanning subgraphs.

Thomas Böhme, Jochen Harant, Matthias Kriesell, Samuel Mohr, Jens M. Schmidt

J. Graph Theory, February, 2024

2023

New bounds on domination and independence in graphs.

Jochen Harant, Samuel Mohr

Discuss. Math. Graph Theory, 2023

2022

Spanning trees of smallest maximum degree in subdivisions of graphs.

Christoph Brause, Jochen Harant, Florian Hörsch, Samuel Mohr

CoRR, 2022

2021

Circumference of essentially 4-connected planar triangulations.

Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt

J. Graph Algorithms Appl., 2021

2020

Long cycles and spanning subgraphs of locally maximal 1-planar graphs.

Igor Fabrici, Jochen Harant, Tomás Madaras, Samuel Mohr, Roman Soták, Carol T. Zamfirescu

J. Graph Theory, 2020

On the Circumference of Essentially 4-connected Planar Graphs.

Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt

J. Graph Algorithms Appl., 2020

Longer cycles in essentially 4-connected planar graphs.

Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt

Discuss. Math. Graph Theory, 2020

2019

On Selkow's bound on the independence number of graphs.

Jochen Harant, Samuel Mohr

Discuss. Math. Graph Theory, 2019

2018

Even Longer Cycles in Essentially 4-Connected Planar Graphs.

Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt

CoRR, 2018

2017

Horst Sachs (1927-2016).

Thomas Böhme, Jochen Harant, Matthias Kriesell, Michael Stiebitz

Discret. Math., 2017

2016

Lower bounds on the sum choice number of a graph.

Jochen Harant, Arnfried Kemnitz

Electron. Notes Discret. Math., 2016

On Longest Cycles in Essentially 4-connected Planar Graphs.

Jochen Harant, Igor Fabrici, Stanislav Jendrol'

Electron. Notes Discret. Math., 2016

Maximum weighted induced subgraphs.

Jochen Harant, Samuel Mohr

Discret. Math., 2016

A note on adjacent vertex distinguishing colorings of graphs.

Maria Axenovich, Jochen Harant, Jakub Przybylo, Roman Soták, Margit Voigt, Jenny Weidelich

Discret. Appl. Math., 2016

2015

Eigenvalue conditions for induced subgraphs.

Jochen Harant, Julia Niebling, Sebastian Richter

Discuss. Math. Graph Theory, 2015

A new eigenvalue bound for independent sets.

Jochen Harant, Sebastian Richter

Discret. Math., 2015

2014

A note on vertex colorings of plane graphs.

Igor Fabrici, Jochen Harant, Stanislav Jendrol', Roman Soták

Discuss. Math. Graph Theory, 2014

On degree sums of a triangle-free graph.

Stephan Brandt, Jochen Harant, Steffi Naumann

Discret. Math., 2014

An upper bound on the sum of powers of the degrees of simple 1-planar graphs.

Július Czap, Jochen Harant, Dávid Hudák

Discret. Appl. Math., 2014

2013

A note on Barnette's Conjecture.

Jochen Harant

Discuss. Math. Graph Theory, 2013

Prescribed edges and forbidden edges for a cycle in a planar graph.

Frank Göring, Jochen Harant

Discret. Appl. Math., 2013

2012

Closures, cycles, and paths.

Jochen Harant, Arnfried Kemnitz, Akira Saito, Ingo Schiermeyer

J. Graph Theory, 2012

The potential of greed for independence.

Piotr Borowiecki, Frank Göring, Jochen Harant, Dieter Rautenbach

J. Graph Theory, 2012

Nonrepetitive vertex colorings of graphs.

Jochen Harant, Stanislav Jendrol'

Discret. Math., 2012

2011

Upper bounds on the sum of powers of the degrees of a simple planar graph.

Jochen Harant, Stanislav Jendrol', Tomás Madaras

J. Graph Theory, 2011

Independence in connected graphs.

Jochen Harant, Dieter Rautenbach

Discret. Appl. Math., 2011

A lower bound on independence in terms of degrees.

Jochen Harant

Discret. Appl. Math., 2011

2010

Random procedures for dominating sets in bipartite graphs.

Sarah Artmann, Jochen Harant

Discuss. Math. Graph Theory, 2010

Packing disjoint cycles over vertex cuts.

Jochen Harant, Dieter Rautenbach, Peter Recht, Ingo Schiermeyer, Eva-Maria Sprengel

Discret. Math., 2010

Packing edge-disjoint cycles in graphs and the cyclomatic number.

Jochen Harant, Dieter Rautenbach, Peter Recht, Friedrich Regen

Discret. Math., 2010

Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs.

Frank Göring, Jochen Harant

Discret. Math., 2010

Random Procedures for Dominating Sets in Graphs.

Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer

Electron. J. Comb., 2010

On Hamiltonian Cycles through Prescribed Edges of a Planar Graph.

Jochen Harant

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009

On <i> F</i>-independence in graphs.

Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer

Discuss. Math. Graph Theory, 2009

A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs.

Jochen Harant, Stefan Senitsch

Discret. Math., 2009

Domination in bipartite graphs.

Jochen Harant, Dieter Rautenbach

Discret. Math., 2009

2008

On long cycles through four prescribed vertices of a polyhedral graph.

Jochen Harant, Stanislav Jendrol', Hansjoachim Walther

Discuss. Math. Graph Theory, 2008

Paths of low weight in planar graphs.

Igor Fabrici, Jochen Harant, Stanislav Jendrol'

Discuss. Math. Graph Theory, 2008

The independence number in graphs of maximum degree three.

Jochen Harant, Michael A. Henning, Dieter Rautenbach, Ingo Schiermeyer

Discret. Math., 2008

Locally Dense Independent Sets in Regular Graphs of Large Girth - An Example of a New Approach.

Frank Göring, Jochen Harant

Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007

On the Existence of Specific Stars in Planar Graphs.

Jochen Harant, Stanislav Jendrol'

Graphs Comb., 2007

On a cycle through a specified linear forest of a graph.

Tobias Gerlach, Jochen Harant

Discret. Math., 2007

2006

A lower bound on the independence number of a graph in terms of degrees.

Jochen Harant, Ingo Schiermeyer

Discuss. Math. Graph Theory, 2006

On cycles through specified vertices.

Tobias Gerlach, Frank Göring, Jochen Harant, Michal Tkác

Discret. Math., 2006

2005

On Double Domination in Graphs.

Jochen Harant, Michael A. Henning

Discuss. Math. Graph Theory, 2005

On Domination in Graphs.

Frank Göring, Jochen Harant

Discuss. Math. Graph Theory, 2005

2004

On paths and cycles through specified vertices.

Jochen Harant

Discret. Math., 2004

On short cycles through prescribed vertices of a graph.

Frank Göring, Jochen Harant, Erhard Hexel, Zsolt Tuza

Discret. Math., 2004

2002

Preface.

Jochen Harant, Ingo Schiermeyer, Margit Voigt

Discuss. Math. Graph Theory, 2002

A note on domination in bipartite graphs.

Tobias Gerlach, Jochen Harant

Discuss. Math. Graph Theory, 2002

Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set.

Jochen Harant, Zdenek Ryjácek, Ingo Schiermeyer

Discret. Math., 2002

2001

On weights of induced paths and cycles in claw-free and <i>K</i>₁_{<i>, r</i>}-free graphs.

Jochen Harant, Margit Voigt, Stanislav Jendrol', Bert Randerath, Zdenek Ryjácek, Ingo Schiermeyer

J. Graph Theory, 2001

Menger's Theorem.

Thomas Böhme, Frank Göring, Jochen Harant

J. Graph Theory, 2001

On the independence number of a graph in terms of order and size.

Jochen Harant, Ingo Schiermeyer

Discret. Math., 2001

Separating 3-cycles in plane triangulations.

Jochen Harant, Mirko Hornák, Zdzislaw Skupien

Discret. Math., 2001

2000

Some news about the independence number of a graph.

Jochen Harant

Discuss. Math. Graph Theory, 2000

1999

More than one tough chordal planar graphs are Hamiltonian.

Thomas Böhme, Jochen Harant, Michal Tkác

J. Graph Theory, 1999

On certain Hamiltonian cycles in planar graphs.

Thomas Böhme, Jochen Harant, Michal Tkác

J. Graph Theory, 1999

On 3-Connected Plane Graphs without Triangular Faces.

Jochen Harant, Stanislav Jendrol', Michal Tkác

J. Comb. Theory, Ser. B, 1999

On Dominating Sets And Independent Sets Of Graphs.

Jochen Harant, Anja Pruchnewski, Margit Voigt

Comb. Probab. Comput., 1999

1998

A lower bound on the independence number of a graph.

Jochen Harant

Discret. Math., 1998

A planarity criterion for cubic bipartite graphs.

Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer

Discret. Math., 1998

On Hamiltonian cycles in 4- and 5-connected plane triangulations.

Thomas Böhme, Jochen Harant

Discret. Math., 1998

1996

5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one.

Jochen Harant, Peter J. Owens, Michal Tkác, Hansjoachim Walther

Discret. Math., 1996

1995

Non-hamiltonian 4/5-tough maximal planar graphs.

Jochen Harant, Peter J. Owens

Discret. Math., 1995

1994

A Lower Bound for the Shortness Coefficient of a Class of Graphs.

Jochen Harant, Hansjoachim Walther

Discret. Appl. Math., 1994

1993

An upper bound for the radius of a 3-connected graph.

Jochen Harant

Discret. Math., 1993

Toughness and nonhamiltonicity of polyhedral graphs.

Jochen Harant

Discret. Math., 1993

1981

On the radius of graphs.

Jochen Harant, Hansjoachim Walther

J. Comb. Theory, Ser. B, 1981