Erhard Hexel

According to our database1, Erhard Hexel authored at least 11 papers between 1988 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
On the <i>H</i>-force number of Hamiltonian graphs and cycle extendability.
Discuss. Math. Graph Theory, 2017

2013
On vertices enforcing a Hamiltonian cycle.
Discuss. Math. Graph Theory, 2013

2007
On short paths through prescribed vertices of a graph.
Discret. Math., 2007

2005
On short cycles through prescribed vertices of a polyhedral graph.
Discuss. Math. Graph Theory, 2005

2004
On short cycles through prescribed vertices of a graph.
Discret. Math., 2004

2002
On light graphs in the family of 4-connected planar graphs.
Discret. Math., 2002

2000
On vertex-degree restricted paths in polyhedral graphs.
Discret. Math., 2000

1994
On Paths of Greedoids and a Minor Characterization.
Eur. J. Comb., 1994

1993
Book review.
ZOR Methods Model. Oper. Res., 1993

1988
Simple Greedoids.
J. Inf. Process. Cybern., 1988

On Shelling Structures - Support and Sum.
J. Inf. Process. Cybern., 1988


  Loading...