A Logical Approach to Hamiltonian Graphs
From MaRDI portal
Modal logic (including the logic of norms) (03B45) Eulerian and Hamiltonian graphs (05C45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
- scientific article; zbMATH DE number 786156
- scientific article; zbMATH DE number 4123770
- scientific article; zbMATH DE number 4087695
- On hamiltonian‐connected graphs
- scientific article; zbMATH DE number 4193714
- scientific article; zbMATH DE number 5917762
- Hamiltonian labelings of graphs
- On hyper-Hamiltonicity in graphs
Cites work
- Computer Science Logic
- CTL^* and ECTL^* as fragments of the modal -calculus
- Graph theory with applications
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 2020180 (Why is no real title available?)
- scientific article; zbMATH DE number 1424043 (Why is no real title available?)
- Modal expressiveness of graph properties
- Modal logic
- Model checking hybrid logics (with an application to semistructured data)
- The computational complexity of hybrid temporal logics
Cited in
(4)
This page was built for publication: A Logical Approach to Hamiltonian Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178965)