Set graphs. V. on representing graphs as membership digraphs

DOI10.1093/LOGCOM/EXU060MaRDI QIDQ5262489zbMATH OpenOpenAlexFDO

Authors Alexandru I. Tomescu, Eugenio 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

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

Recommendations

• Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
• Set graphs. IV. Further connections with claw-freeness
• Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
• On sets and graphs. Perspectives on logic and combinatorics
• Claw-free graphs. IV: Decomposition theorem

Cited in

(4)

• Set graphs. IV. Further connections with claw-freeness
• On sets and graphs. Perspectives on logic and combinatorics
• Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
• Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262489)