| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jochen Harant, Stanislav Jendrol |
Nonrepetitive vertex colorings of graphs.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Arnfried Kemnitz, Akira Saito, Ingo Schiermeyer |
Closures, cycles, and paths. |
Journal of Graph Theory |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Stanislav Jendrol, Tomás Madaras |
Upper bounds on the sum of powers of the degrees of a simple planar graph. |
Journal of Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Dieter Rautenbach |
Independence in connected graphs. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant |
A lower bound on independence in terms of degrees. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Dieter Rautenbach, Peter Recht, Friedrich Regen |
Packing edge-disjoint cycles in graphs and the cyclomatic number. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Dieter Rautenbach, Peter Recht, Ingo Schiermeyer, Eva-Maria Sprengel |
Packing disjoint cycles over vertex cuts. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Göring, Jochen Harant |
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer |
Random Procedures for Dominating Sets in Graphs. |
Electr. J. Comb. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Sarah Artmann, Jochen Harant |
Random procedures for dominating sets in bipartite graphs. |
Discussiones Mathematicae Graph Theory |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jochen Harant |
On Hamiltonian Cycles through Prescribed Edges of a Planar Graph. |
CTW |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jochen Harant, Stefan Senitsch |
A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Dieter Rautenbach |
Domination in bipartite graphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer |
On F-independence in graphs. |
Discussiones Mathematicae Graph Theory |
2009 |
DBLP BibTeX RDF |
|
| 1 | Jochen Harant, Michael A. Henning, Dieter Rautenbach, Ingo Schiermeyer |
The independence number in graphs of maximum degree three. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Fabrici, Jochen Harant, Stanislav Jendrol |
Paths of low weight in planar graphs. |
Discussiones Mathematicae Graph Theory |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jochen Harant, Stanislav Jendrol, Hansjoachim Walther |
On long cycles through four prescribed vertices of a polyhedral graph. |
Discussiones Mathematicae Graph Theory |
2008 |
DBLP BibTeX RDF |
|
| 1 | Tobias Gerlach, Jochen Harant |
On a cycle through a specified linear forest of a graph. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Stanislav Jendrol |
On the Existence of Specific Stars in Planar Graphs. |
Graphs and Combinatorics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Gerlach, Frank Göring, Jochen Harant, Michal Tkác |
On cycles through specified vertices. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Ingo Schiermeyer |
A lower bound on the independence number of a graph in terms of degrees. |
Discussiones Mathematicae Graph Theory |
2006 |
DBLP BibTeX RDF |
|
| 1 | Frank Göring, Jochen Harant |
On Domination in Graphs. |
Discussiones Mathematicae Graph Theory |
2005 |
DBLP BibTeX RDF |
|
| 1 | Jochen Harant, Michael A. Henning |
On Double Domination in Graphs. |
Discussiones Mathematicae Graph Theory |
2005 |
DBLP BibTeX RDF |
|
| 1 | Jochen Harant |
On paths and cycles through specified vertices. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Göring, Jochen Harant, Erhard Hexel, Zsolt Tuza |
On short cycles through prescribed vertices of a graph. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Zdenek Ryjácek, Ingo Schiermeyer |
Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Mirko Hornák, Zdzislaw Skupien |
Separating 3-cycles in plane triangulations. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Ingo Schiermeyer |
On the independence number of a graph in terms of order and size. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Stanislav Jendrol, Michal Tkác |
On 3-Connected Plane Graphs without Triangular Faces. |
J. Comb. Theory, Ser. B |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Anja Pruchnewski, Margit Voigt |
On Dominating Sets And Independent Sets Of Graphs. |
Combinatorics, Probability & Computing |
1999 |
DBLP BibTeX RDF |
|
| 1 | Thomas Böhme, Jochen Harant |
On Hamiltonian cycles in 4- and 5-connected plane triangulations. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant |
A lower bound on the independence number of a graph. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer |
A planarity criterion for cubic bipartite graphs. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Peter J. Owens |
Non-hamiltonian 4/5-tough maximal planar graphs. |
Discrete Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Hansjoachim Walther |
A Lower Bound for the Shortness Coefficient of a Class of Graphs. |
Discrete Applied Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant |
Toughness and nonhamiltonicity of polyhedral graphs. |
Discrete Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant |
An upper bound for the radius of a 3-connected graph. |
Discrete Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Hansjoachim Walther |
On the radius of graphs. |
J. Comb. Theory, Ser. B |
1981 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")