Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Harant, Jochen
77  Ergebnisse:
Personensuche X
?
1

Rooted minors and locally spanning subgraphs:

Böhme, Thomas ; Harant, Jochen ; Kriesell, Matthias..
Journal of Graph Theory.  105 (2023)  2 - p. 209-229 , 2023
Link: https://doi.org/10.1002/..
 
?
2

Circumference of essentially 4-connected planar triangulati..:

Fabrici, Igor ; Harant, Jochen ; Mohr, Samuel.
Journal of Graph Algorithms and Applications.  25 (2021)  1 - p. 121-132 , 2021
Link: https://doi.org/10.7155/..
 
?
3

On the Circumference of Essentially 4-connected Planar Grap..:

Fabrici, Igor ; Harant, Jochen ; Mohr, Samuel.
Journal of Graph Algorithms and Applications.  24 (2020)  1 - p. 21-46 , 2020
Link: https://doi.org/10.7155/..
 
?
4

Horst Sachs (1927–2016):

Böhme, Thomas ; Harant, Jochen ; Kriesell, Matthias.
Discrete Mathematics.  340 (2017)  11 - p. 2615 , 2017
Link: https://doi.org/10.1016/..
 
?
5

On Longest Cycles in Essentially 4-connected Planar Graphs:

Harant, Jochen ; Fabrici, Igor ; Jendrol', Stanislav
Electronic Notes in Discrete Mathematics.  55 (2016)  - p. 143-146 , 2016
Link: https://doi.org/10.1016/..
 
?
6

Lower bounds on the sum choice number of a graph:

Harant, Jochen ; Kemnitz, Arnfried
Electronic Notes in Discrete Mathematics.  53 (2016)  - p. 421-431 , 2016
Link: https://doi.org/10.1016/..
 
?
7

An upper bound on the sum of powers of the degrees of simpl..:

Czap, Július ; Harant, Jochen ; Hudák, Dávid
Discrete Applied Mathematics.  165 (2014)  - p. 146-151 , 2014
Link: https://doi.org/10.1016/..
 
?
8

On degree sums of a triangle-free graph:

Brandt, Stephan ; Harant, Jochen ; Naumann, Steffi
Discrete Mathematics.  337 (2014)  - p. 76-82 , 2014
Link: https://doi.org/10.1016/..
 
?
9

Prescribed edges and forbidden edges for a cycle in a plana..:

Göring, Frank ; Harant, Jochen
Discrete Applied Mathematics.  161 (2013)  12 - p. 1734-1738 , 2013
Link: https://doi.org/10.1016/..
 
?
10

Nonrepetitive vertex colorings of graphs:

Harant, Jochen ; Jendrol', Stanislav
Discrete Mathematics.  312 (2012)  2 - p. 374-380 , 2012
Link: https://doi.org/10.1016/..
 
?
11

A lower bound on independence in terms of degrees:

Harant, Jochen
Discrete Applied Mathematics.  159 (2011)  10 - p. 966-970 , 2011
Link: https://doi.org/10.1016/..
 
?
12

Independence in connected graphs:

Harant, Jochen ; Rautenbach, Dieter
Discrete Applied Mathematics.  159 (2011)  1 - p. 79-86 , 2011
Link: https://doi.org/10.1016/..
 
?
13

The potential of greed for independence:

Borowiecki, Piotr ; Göring, Frank ; Harant, Jochen.
Journal of Graph Theory.  71 (2011)  3 - p. 245-259 , 2011
Link: https://doi.org/10.1002/..
 
?
14

Closures, cycles, and paths:

Harant, Jochen ; Kemnitz, Arnfried ; Saito, Akira.
Journal of Graph Theory.  69 (2011)  3 - p. 314-323 , 2011
Link: https://doi.org/10.1002/..
 
?
15

Packing disjoint cycles over vertex cuts:

Harant, Jochen ; Rautenbach, Dieter ; Recht, Peter..
Discrete Mathematics.  310 (2010)  13-14 - p. 1974-1978 , 2010
Link: https://doi.org/10.1016/..
 
1-15