On representing graphs as membership digraphs - A proof scenario checked by Referee

Eugenio Omodeo, Alexandru Ioan Tomescu

Research output: Non-textual formSoftwareScientific

Original languageEnglish
Publication statusPublished - 2015
MoE publication typeI2 ICT software

Bibliographical note

This proof scenario accompanies the paper: Eugenio G. Omodeo, Alexandru I. Tomescu, Set Graphs. V. On representing graphs as membership digraphs, Journal of Logic and Computation 25(3), 899-919, 2015

Fields of Science

  • 113 Computer and information sciences

Cite this