Accesso libero

Underlying Simple Graphs

  
17 feb 2020
INFORMAZIONI SU QUESTO ARTICOLO

Cita
Scarica la copertina

In this article the notion of the underlying simple graph of a graph (as defined in [8]) is formalized in the Mizar system [5], along with some convenient variants. The property of a graph to be without decorators (as introduced in [7]) is formalized as well to serve as the base of graph enumerations in the future.

Lingua:
Inglese
Frequenza di pubblicazione:
1 volte all'anno
Argomenti della rivista:
Informatica, Informatica, altro, Matematica, Matematica generale