Zacytuj

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.

eISSN:
1898-9934
ISSN:
1426-2630
Język:
Angielski
Częstotliwość wydawania:
Volume Open
Dziedziny czasopisma:
Computer Sciences, other, Mathematics, General Mathematics