In [V2], Vince outlined three potential graph algorithms for $S^3$ recognition, namely shelling, reducing, and closing; on the other hand, he conjectured that the graph $H_0$ of Fig.1 - which proves the first two to fail - could be a counterexample for the third one, too. This note shows that the conjecture is false; so, the validity of the closing algorithm is still an open problem.

A note about the closing S3 recognition algorithm / Casali, Maria Rita. - In: ARS COMBINATORIA. - ISSN 0381-7032. - STAMPA. - 39:(1995), pp. 155-160.

A note about the closing S3 recognition algorithm

CASALI, Maria Rita
1995

Abstract

In [V2], Vince outlined three potential graph algorithms for $S^3$ recognition, namely shelling, reducing, and closing; on the other hand, he conjectured that the graph $H_0$ of Fig.1 - which proves the first two to fail - could be a counterexample for the third one, too. This note shows that the conjecture is false; so, the validity of the closing algorithm is still an open problem.
1995
39
155
160
A note about the closing S3 recognition algorithm / Casali, Maria Rita. - In: ARS COMBINATORIA. - ISSN 0381-7032. - STAMPA. - 39:(1995), pp. 155-160.
Casali, Maria Rita
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/305481
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 0
social impact