A Logical Approach to Hamiltonian Graphs

DOI10.1016/j.entcs.2009.07.052zbMath1310.68145OpenAlexW2015503648MaRDI QIDQ5178965

L. Menasché Schechter

Publication date: 18 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.07.052

zbMATH Keywords

computational complexitymodel checkingmodal logicsHamiltonian graphsframe checking

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
• Model checking hybrid logics (with an application to semistructured data)
• Modal Expressiveness of Graph Properties
• The computational complexity of hybrid temporal logics
• Computer Science Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Logical Approach to Hamiltonian Graphs