Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
From MaRDI portal
Publication:2352482
DOI10.1007/s10817-012-9272-3zbMath1315.68223OpenAlexW2085329915MaRDI QIDQ2352482
Alexandru I. Tomescu, Eugenio Giovanni Omodeo
Publication date: 2 July 2015
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-012-9272-3
Structural characterization of families of graphs (05C75) Mechanization of proofs and logical operations (03B35)
Related Items (5)
Set graphs. IV. Further connections with claw-freeness ⋮ Set-syllogistics meet combinatorics ⋮ A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs ⋮ Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* ⋮ Set graphs. II. Complexity of set graph recognition and similar problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks
- Machine-based methods in parameterized complexity theory
- Claw-free graphs. VI: Colouring
- The strong perfect graph theorem
- Interval graphs and related topics
- Set theory in first-order logic: Clauses for Gödel's axioms
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Automated deduction in von Neumann-Bernays-Gödel set theory
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- On computer-assisted proofs in ordinal number theory
- Claw-free graphs---a survey
- Quasi-claw-free graphs
- Computer proofs about finite and regular sets: The unifying concept of subvariance.
- The problem of finding an inference rule for set theory
- A comparison of Mizar and Isar
- Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
- A framework for the verification of certifying computations
- Claw-free graphs. I: Orientable prismatic graphs
- Hamiltonian results inK1,3-free graphs
- Theory-Specific Automated Reasoning
- Combining Type Theory and Untyped Set Theory
- The square of a connected S(K1,3)-free graph is vertex pancyclic
- On partitioning the edges of graphs into connected subgraphs
- Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
- Graphs with 1-Factors
- Graph Classes: A Survey
- Almost claw‐free graphs
- Set intersection representations for almost all graphs
- Computational Logic and Set Theory
- Verification: Theory and Practice
- Theorem Proving in Higher Order Logics
- Characterizations of derived graphs
- Sur deux propriétés des classes d'ensembles
- Automated Deduction – CADE-19
This page was built for publication: Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
