Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
From MaRDI portal
Publication:1941395
DOI10.1016/j.dam.2011.11.027zbMath1259.05143OpenAlexW1983080496MaRDI QIDQ1941395
Alexandru I. Tomescu, Martin Milanič
Publication date: 12 March 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.11.027
Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)
Related Items (5)
Digraph parameters and finite set arithmetic ⋮ Set graphs. IV. Further connections with claw-freeness ⋮ A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs ⋮ Set graphs. II. Complexity of set graph recognition and similar problems ⋮ Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
Uses Software
This page was built for publication: Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
