Second-order properties of undirected graphs

DOI10.1007/978-3-030-88701-8_13OpenAlexW3209205547MaRDI QIDQ2695354

Walter Guttmann

Publication date: 30 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-88701-8_13

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• Nitpick
• Isabelle/HOL
• Isar
• Prover9
• Mace4
• Sledgehammer
• Archive Formal Proofs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Combinatory logic. With two sections by William Craig.
• Relation algebras: Concept of points and representability
• A linear-time algorithm for finding a minimum spanning pseudoforest
• Winskel is (almost) right: Towards a mechanized semantics textbook
• A completeness theorem for Kleene algebras and the algebra of regular events
• Minimal relation algebras
• Isabelle/HOL. A proof assistant for higher-order logic
• An algebraic framework for minimum spanning tree problems
• Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
• Verifying minimum spanning tree algorithms with Stone relation algebras
• Relational characterisations of paths
• Extending Sledgehammer with SMT solvers
• On Automated Program Construction and Verification
• A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
• Pair-Dense Relation Algebras
• Introduction to Relation Algebras
• Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder

This page was built for publication: Second-order properties of undirected graphs