Séminaire Lotharingien de Combinatoire, B10w (1984), 1 p.
[Formerly: Publ. I.R.M.A. Strasbourg, 1987, 340/S-10, p.
121.]
Eberhard Triesch
Neue Ergebnisse üher die Komplexität
von Grapheneigenschaften
Abstract.
Using methods of algebraic topology as developed by Kahn, Saks and
Sturtevant, I show that any monotone decreasing graph property
that implies "girth > 5" or "planarity" is elusive.
The following version is available: