Jochen Harant

发表

A note on adjacent vertex distinguishing colorings of graphs

Maria Axenovich, Jochen Harant, Jakub Przybylo, 2016, Discret. Appl. Math..

A Note on Barnette’s Conjecture

Jochen Harant, J. Harant, 2013, Discuss. Math. Graph Theory.

Lower bounds on the sum choice number of a graph

Jochen Harant, Arnfried Kemnitz, 2016, Electron. Notes Discret. Math..

On Domination in Graphs

Jochen Harant, Frank Göring, Frank Göring, 2005, Discuss. Math. Graph Theory.

Some news about the independence number of a graph

Jochen Harant, 2000, Discuss. Math. Graph Theory.

On Selkow’s Bound on the Independence Number of Graphs

Jochen Harant, Samuel Mohr, 2019, Discuss. Math. Graph Theory.

On short cycles through prescribed vertices of a graph

Zsolt Tuza, Jochen Harant, Erhard Hexel, 2004, Discret. Math..

On the radius of graphs

Jochen Harant, Hansjoachim Walther, 1981, J. Comb. Theory, Ser. B.

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

Jochen Harant, Stefan Mengel, 2009, Discret. Math..

Random Procedures for Dominating Sets in Graphs

Dieter Rautenbach, Jochen Harant, Ingo Schiermeyer, 2010, Electron. J. Comb..

Non-hamiltonian 4/5-tough maximal planar graphs

Jochen Harant, P. J. Owens, 1995, Discret. Math..

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

Jochen Harant, Frank Göring, 2008, Bonn Workshop of Combinatorial Optimization.

The independence number in graphs of maximum degree three

Dieter Rautenbach, Michael A. Henning, Jochen Harant, 2008, Discret. Math..

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

Jochen Harant, Ingo Schiermeyer, 2001, Discret. Math..

Nonrepetitive vertex colorings of graphs

Stanislav Jendrol', Jochen Harant, J. Harant, 2012, Discret. Math..

Longer Cycles in Essentially 4-Connected Planar Graphs

Jochen Harant, Jens M. Schmidt, Igor Fabrici, 2017, Discuss. Math. Graph Theory.

Independence in connected graphs

Dieter Rautenbach, Jochen Harant, 2011, Discret. Appl. Math..

Algorithms for the Maximum Independent Set Problem

Jochen Harant, Ingo Schiermeyer, I. Schiermeyer, 2014 .

On Dominating Sets and Independent Sets of Graphs

Jochen Harant, Margit Voigt, Anja Pruchnewski, 1999, Combinatorics, Probability and Computing.

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

Jochen Harant, Igor Fabrici, Carol T. Zamfirescu, 2020, J. Graph Theory.

A planarity criterion for cubic bipartite graphs

Jochen Harant, Thomas Böhme, Ingo Schiermeyer, 1998, Discret. Math..

A lower bound on the independence number of a graph

Jochen Harant, J. Harant, 1998, Discret. Math..

Toughness and nonhamiltonicity of polyhedral graphs

Jochen Harant, 1993, Discret. Math..

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

Jochen Harant, Ingo Schiermeyer, 2006, Discuss. Math. Graph Theory.

Packing disjoint cycles over vertex cuts

Dieter Rautenbach, Jochen Harant, Ingo Schiermeyer, 2010, Discret. Math..

On 3-Connected Plane Graphs without Triangular Faces

Stanislav Jendrol', Jochen Harant, Michal Tkác, 1999, J. Comb. Theory, Ser. B.

5-regular 3-polytopal Graphs with Edges of Only Two Types and Shortness Exponents Less than One

Jochen Harant, P. J. Owens, Hansjoachim Walther, 1996, Discret. Math..

Eigenvalue Conditions for Induced Subgraphs

Jochen Harant, Julia Niebling, Sebastian Richter, 2015, Discuss. Math. Graph Theory.

Domination in bipartite graphs

Dieter Rautenbach, Jochen Harant, 2009, Discret. Math..

Preface

Jochen Harant, Margit Voigt, Ingo Schiermeyer, 2002, Discuss. Math. Graph Theory.

A Note On Vertex Colorings Of Plane Graphs

Stanislav Jendrol', Jochen Harant, Roman Soták, 2014, Discuss. Math. Graph Theory.

Paths of low weight in planar graphs

Stanislav Jendrol', Jochen Harant, Igor Fabrici, 2008, Discuss. Math. Graph Theory.

On Longest Cycles in Essentially 4-Connected Planar Graphs

Stanislav Jendrol', Jochen Harant, Igor Fabrici, 2016, Discuss. Math. Graph Theory.

Closures, cycles, and paths

Akira Saito, Jochen Harant, Ingo Schiermeyer, 2012, J. Graph Theory.

Horst Sachs (1927-2016)

Michael Stiebitz, Jochen Harant, Matthias Kriesell, 2017, Discret. Math..

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

Jochen Harant, 1993, Discret. Math..

On paths and cycles through specified vertices

Jochen Harant, 2004, Discret. Math..

On a cycle through a specified linear forest of a graph

Jochen Harant, Tobias Gerlach, 2007, Discret. Math..

On F-independence in graphs

Dieter Rautenbach, Jochen Harant, Ingo Schiermeyer, 2009, Discuss. Math. Graph Theory.

On certain Hamiltonian cycles in planar graphs

Jochen Harant, Thomas Böhme, Michal Tkác, 1999, J. Graph Theory.

On the Circumference of Essentially 4-connected Planar Graphs

Jochen Harant, Jens M. Schmidt, Igor Fabrici, 2020, J. Graph Algorithms Appl..

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

Jochen Harant, Thomas Böhme, 1998, Discret. Math..

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, 2014, Discret. Appl. Math..

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

Jochen Harant, Frank Göring, 2010, Discret. Math..

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

Zdenek Ryjácek, Jochen Harant, Ingo Schiermeyer, 2002, Discret. Math..

On Hamiltonian Cycles through Prescribed Edges of a Planar Graph

Jochen Harant, 2010, CTW.

Separating 3-cycles in plane triangulations

Zdzislaw Skupien, Jochen Harant, Mirko Hornák, 2001, Discret. Math..

A note on domination in bipartite graphs

Jochen Harant, Tobias Gerlach, 2002, Discuss. Math. Graph Theory.

A lower bound on independence in terms of degrees

Jochen Harant, 2011, Discret. Appl. Math..

On the Existence of Specific Stars in Planar Graphs

Stanislav Jendrol', Jochen Harant, 2007, Graphs Comb..

Menger's Theorem

Jochen Harant, Thomas Böhme, Frank Göring, 2001, J. Graph Theory.

Random procedures for dominating sets in bipartite graphs

Jochen Harant, Sarah Artmann, 2010, Discuss. Math. Graph Theory.

On long cycles through four prescribed vertices of a polyhedral graph

Stanislav Jendrol', Jochen Harant, Hansjoachim Walther, 2008, Discuss. Math. Graph Theory.

More than one tough chordal planar graphs are Hamiltonian

Jochen Harant, Thomas Böhme, Michal Tkác, 1999, J. Graph Theory.

On degree sums of a triangle-free graph

Jochen Harant, Steffi Naumann, Stephan Brandt, 2014, Discret. Math..

On cycles through specified vertices

Jochen Harant, Michal Tkác, Frank Göring, 2006, Discret. Math..

The potential of greed for independence

Dieter Rautenbach, Jochen Harant, Frank Göring, 2012, J. Graph Theory.

Maximum weighted induced subgraphs

Jochen Harant, Samuel Mohr, J. Harant, 2016, Discret. Math..

A new eigenvalue bound for independent sets

Jochen Harant, Sebastian Richter, J. Harant, 2015, Discret. Math..

On weights of induced paths and cycles in claw-free and K1, r-free graphs

Stanislav Jendrol', Zdenek Ryjácek, Jochen Harant, 2001, J. Graph Theory.

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

Stanislav Jendrol', Tomás Madaras, Jochen Harant, 2011, J. Graph Theory.

On Longest Cycles in Essentially 4-connected Planar Graphs

Stanislav Jendrol', Jochen Harant, Igor Fabrici, 2016, Electron. Notes Discret. Math..

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

Jochen Harant, Frank Göring, 2013, Discret. Appl. Math..

On Double Domination in Graphs

Michael A. Henning, Jochen Harant, J. Harant, 2005, Discuss. Math. Graph Theory.

Packing edge-disjoint cycles in graphs and the cyclomatic number

Dieter Rautenbach, Jochen Harant, Friedrich Regen, 2010, Discret. Math..

New Bounds on Domination and Independence in Graphs1

Jochen Harant, Samuel Mohr, 2021, Discussiones Mathematicae Graph Theory.

Circumference of essentially 4-connected planar triangulations

Jochen Harant, Jens M. Schmidt, Igor Fabrici, 2021, J. Graph Algorithms Appl..

Some new results about the shortness exponent in polyhedral graphs

Jochen Harant, Hansjoachim Walther, 1987 .

More than one tough chordal planar graphs are Hamiltonian

Jochen Harant, Thomas Böhme, Michal Tkáč, 1999 .

On a Problem Concerning Longest Circuits in Polyhedral Graphs

Jochen Harant, Hansjoachim Walther, J. Harant, 1988 .

A Note on the Domination Number of a Bipartite Graph

Jochen Harant, Anja Pruchnewski, 2001 .

On weights of induced paths and cycles in claw-free and K 1 ,r -free graphs

Zdenek Ryjácek, Jochen Harant, Margit Voigt, 2001 .

Menger's Theorem

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

On certain Hamiltonian cycles in planar graphs

Jochen Harant, Thomas Böhme, Michal Tkáč, 1999 .

Forbidden subgraphs and MIN-algorithm for independence number

Zdenek Ryjácek, Jochen Harant, Ingo Schiermeyer, 1999 .