Set Graphs. V. On representing graphs as membership digraphs

DOI10.1093/logcom/exu060zbMath1331.68203OpenAlexW2096787290MaRDI QIDQ5262489

Alexandru I. Tomescu, Eugenio Giovanni Omodeo

Publication date: 15 July 2015

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/10fe369865815f43b691480aec0aff78efc31596

zbMATH Keywords

graphsdigraphsproof checkingtheory-based automated reasoningMostowski's decorationreferee a.k.a. Ætnanova

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Mechanization of proofs and logical operations (03B35) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Set graphs. IV. Further connections with claw-freeness

This page was built for publication: Set Graphs. V. On representing graphs as membership digraphs