Shortness Exponents of Families of Graphs. - Branko Grünbaum; Hansjoachim Walther (J. Comb. Theory A, 1973)

Remark on a paper of J. Zaks. - Hansjoachim Walther (Discret. Math., 1979)

Note on two problems of J. Zaks concerning Hamiltonian 3-polytopes. - Hansjoachim Walther (Discret. Math., 1981)

On the radius of graphs. - Jochen Harant; Hansjoachim Walther (J. Comb. Theory B, 1981)

On the chromatic number of special distance graphs. - Margit Voigt; Hansjoachim Walther (Discret. Math., 1991)

A Lower Bound for the Shortness Coefficient of a Class of Graphs. - Jochen Harant; Hansjoachim Walther (Discret. Appl. Math., 1994)

Chromatic Number of Prime Distance Graphs. - Margit Voigt; Hansjoachim Walther (Discret. Appl. Math., 1994)

Hamiltonicity in multitriangular graphs. - Peter J. Owens; Hansjoachim Walther (Discuss. Math. Graph Theory, 1995)

5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one. - Jochen Harant; Peter J. Owens; Michal Tkác; Hansjoachim Walther (Discret. Math., 1996)

A nonhamiltonian five-regular multitriangular polyhedral graph. - Hansjoachim Walther (Discret. Math., 1996)

Polyhedral Graphs Without Hamiltonian Cycles. - Hansjoachim Walther (Discret. Appl. Math., 1997)

On vertex-degree restricted paths in polyhedral graphs. - Igor Fabrici; Erhard Hexel; Stanislav Jendrol'; Hansjoachim Walther (Discret. Math., 2000)

Non-hamiltonian polyhedral graphs with two types of faces. - Igor Fabrici; Peter J. Owens; Hansjoachim Walther (Discret. Math., 2000)

Polyhedral graphs with extreme numbers of types of faces. - Hansjoachim Walther (Discret. Appl. Math., 2002)

Polyhedral graphs with restricted number of faces of the same type. - Margit Voigt; Hansjoachim Walther (Discret. Math., 2002)

Some news about oblique graphs. - Andrey A. Dobrynin; Leonid S. Melnikov; Jens Schreyer; Hansjoachim Walther (Discuss. Math. Graph Theory, 2002)

Edge-oblique polyhedral graphs. - Jens Schreyer; Hansjoachim Walther (Discret. Appl. Math., 2004)

Vertex-oblique graphs. - Jens Schreyer; Hansjoachim Walther; Leonid S. Melnikov (Discret. Math., 2007)

On long cycles through four prescribed vertices of a polyhedral graph. - Jochen Harant; Stanislav Jendrol'; Hansjoachim Walther (Discuss. Math. Graph Theory, 2008)