| 2009 |
|---|
| 20 | EE | Jochen Harant,
Dieter Rautenbach:
Domination in bipartite graphs.
Discrete Mathematics 309(1): 113-122 (2009) |
| 2008 |
|---|
| 19 | EE | Jochen Harant,
Michael A. Henning,
Dieter Rautenbach,
Ingo Schiermeyer:
The independence number in graphs of maximum degree three.
Discrete Mathematics 308(23): 5829-5833 (2008) |
| 2007 |
|---|
| 18 | EE | Tobias Gerlach,
Jochen Harant:
On a cycle through a specified linear forest of a graph.
Discrete Mathematics 307(7-8): 892-895 (2007) |
| 2006 |
|---|
| 17 | EE | Tobias Gerlach,
Frank Göring,
Jochen Harant,
Michal Tkác:
On cycles through specified vertices.
Discrete Mathematics 306(8-9): 831-835 (2006) |
| 2004 |
|---|
| 16 | EE | Frank Göring,
Jochen Harant,
Erhard Hexel,
Zsolt Tuza:
On short cycles through prescribed vertices of a graph.
Discrete Mathematics 286(1-2): 67-74 (2004) |
| 15 | EE | Jochen Harant:
On paths and cycles through specified vertices.
Discrete Mathematics 286(1-2): 95-98 (2004) |
| 2002 |
|---|
| 14 | EE | Jochen Harant,
Zdenek Ryjácek,
Ingo Schiermeyer:
Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set.
Discrete Mathematics 256(1-2): 193-201 (2002) |
| 2001 |
|---|
| 13 | EE | Jochen Harant,
Ingo Schiermeyer:
On the independence number of a graph in terms of order and size.
Discrete Mathematics 232(1-3): 131-138 (2001) |
| 12 | EE | Jochen Harant,
Mirko Hornák,
Zdzislaw Skupien:
Separating 3-cycles in plane triangulations.
Discrete Mathematics 239(1-3): 127-136 (2001) |
| 1999 |
|---|
| 11 | | Jochen Harant,
Anja Pruchnewski,
Margit Voigt:
On Dominating Sets And Independent Sets Of Graphs.
Combinatorics, Probability & Computing 8(6): (1999) |
| 10 | EE | Jochen Harant,
Stanislav Jendrol,
Michal Tkác:
On 3-Connected Plane Graphs without Triangular Faces.
J. Comb. Theory, Ser. B 77(1): 150-161 (1999) |
| 1998 |
|---|
| 9 | EE | Jochen Harant:
A lower bound on the independence number of a graph.
Discrete Mathematics 188(1-3): 239-243 (1998) |
| 8 | EE | Thomas Böhme,
Jochen Harant:
On Hamiltonian cycles in 4- and 5-connected plane triangulations.
Discrete Mathematics 191(1-3): 25-30 (1998) |
| 7 | EE | Thomas Böhme,
Jochen Harant,
Anja Pruchnewski,
Ingo Schiermeyer:
A planarity criterion for cubic bipartite graphs.
Discrete Mathematics 191(1-3): 31-43 (1998) |
| 1996 |
|---|
| 6 | EE | 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 150(1-3): 143-153 (1996) |
| 1995 |
|---|
| 5 | EE | Jochen Harant,
Peter J. Owens:
Non-hamiltonian 4/5-tough maximal planar graphs.
Discrete Mathematics 147(1-3): 301-305 (1995) |
| 1994 |
|---|
| 4 | EE | Jochen Harant,
Hansjoachim Walther:
A Lower Bound for the Shortness Coefficient of a Class of Graphs.
Discrete Applied Mathematics 51(1-2): 103-105 (1994) |
| 1993 |
|---|
| 3 | EE | Jochen Harant:
Toughness and nonhamiltonicity of polyhedral graphs.
Discrete Mathematics 113(1-3): 249-253 (1993) |
| 2 | EE | Jochen Harant:
An upper bound for the radius of a 3-connected graph.
Discrete Mathematics 122(1-3): 335-341 (1993) |
| 1981 |
|---|
| 1 | EE | Jochen Harant,
Hansjoachim Walther:
On the radius of graphs.
J. Comb. Theory, Ser. B 30(1): 113-117 (1981) |
