FO Model Checking of Interval Graphs

DOI10.2168/LMCS-11(4:11)2015zbMath1448.68299OpenAlexW2398186705WikidataQ57601330 ScholiaQ57601330MaRDI QIDQ3460413

Robert Ganian, Petr Hliněný, Jakub Teska, Jarett Schwartz, Jan Obdržálek, Daniel Král'

Publication date: 7 January 2016

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-11(4:11)2015

zbMATH Keywords

interval graphclique-widthparameterized complexityfirst-order model checking

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (5)

FO model checking on geometric graphs ⋮ Unnamed Item ⋮ Reducing CMSO model checking to highly connected graphs ⋮ On the classes of interval graphs of limited nesting and count of lengths ⋮ Unnamed Item

This page was built for publication: FO Model Checking of Interval Graphs