:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Filmus, Yuval, Makowsky, Johann A.
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science 05C85, 03C13, 68R10
Online Access:	https://arxiv.org/abs/2505.02771
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Paths, Ends and The Separation Problem for Infinite Graphs
by: Carrasco-Vargas, Nicanor, et al.
Published: (2024)

Preservation theorems on sparse classes revisited
by: Dawar, Anuj, et al.
Published: (2024)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
by: Golovach, Petr A., et al.
Published: (2022)

First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs
by: Geniet, Colin, et al.
Published: (2022)

State Canonization and Early Pruning in Width-Based Automated Theorem Proving
by: Oliveira, Mateus de Oliveira, et al.
Published: (2026)

Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
by: Sau, Ignasi, et al.
Published: (2026)

Browsing Large Graphs with Tile Pyramids and Sleeve Routing in the Browser
by: Nachmanson, Lev, et al.
Published: (2026)

A Linear Kernel for Independent Set Reconfiguration in Planar Graphs
by: Bousquet, Nicolas, et al.
Published: (2025)

Graded Monads in the Semantics of Nominal Automata
by: Schulze, Hannes, et al.
Published: (2025)

A Reflection Principle for Potential Infinite Models of Type Theory
by: Eberl, Matthias
Published: (2024)

Exploring P versus NP
by: Tang, Jian-Gang
Published: (2022)

Perfect Edge Domination in $P_6$-free Graphs and in Graphs Without Efficient Edge Dominating Sets
by: Grippo, Luciano N., et al.
Published: (2025)

The zero blocking numbers of grid graphs
by: Lin, Hau-Yi, et al.
Published: (2025)

Zero blocking numbers of graphs with complexity results
by: Lin, Hau-Yi, et al.
Published: (2025)

The zero blocking numbers of generalized Kneser graphs and generalized Johnson graphs
by: Lin, Hau-Yi, et al.
Published: (2025)

Quota Trees
by: White, Tad
Published: (2024)

Reconstructing a graph from the distance matrix of its boundary
by: Cáceres, José, et al.
Published: (2024)

Extremal Trees With Prescribed Burning Numbers
by: Leong, Eugene Jun Tong, et al.
Published: (2025)

Parameterizing the quantification of CMSO: model checking on minor-closed graph classes
by: Sau, Ignasi, et al.
Published: (2024)

Minimal obstructions to $C_5$-coloring in hereditary graph classes
by: Goedgebeur, Jan, et al.
Published: (2024)

Polynomial Bounds for the Graph Minor Structure Theorem
by: Gorsky, Maximilian, et al.
Published: (2025)

A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifiers
by: Sun, Shixin, et al.
Published: (2026)

Elementary equivalence of endomorphism rings and automorphism groups of periodic Abelian groups
by: Bunina, Elena
Published: (2024)

Catching Rats in $H$-minor-free Graphs
by: Gorsky, Maximilian, et al.
Published: (2025)

A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space
by: Bergougnoux, Benjamin, et al.
Published: (2025)

TreeWidzard: An Engine for Width-Based Dynamic Programming and Automated Theorem Proving
by: Oliveria, Mateus de Oliveira, et al.
Published: (2026)

The Local Structure Theorem for Graph Minors with finite index
by: Paul, Christophe, et al.
Published: (2025)

Three results towards the approximation of special maximum matchings in graphs
by: Mkrtchyan, Vahan
Published: (2024)

$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses
by: Contreras-Mendoza, Fernando Esteban, et al.
Published: (2022)

Infinite Eulerian paths are computable on graphs with vertices of infinite degree
by: Carrasco-Vargas, Nicanor
Published: (2023)

Algorithmic releases on the spanning trees of suitable graphs
by: Imbesi, Maurizio, et al.
Published: (2017)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
by: Bannach, Max, et al.
Published: (2025)

A Cut-Free Sequent Calculus for the Analysis of Finite-Trace Properties in Concurrent Systems
by: Fusco, Ludovico, et al.
Published: (2025)

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
by: Furmańczyk, Hanna, et al.
Published: (2020)

Small-scale operations on graphic sequences
by: Rusu, Irena
Published: (2026)

A Structural Feature-Based Approach for Comprehensive Graph Classification
by: Islam, Saiful, et al.
Published: (2024)

A Note on Graph Burning of Path Forests
by: Tan, Ta Sheng, et al.
Published: (2023)

Measurability in the Fundamental Theorem of Statistical Learning
by: Krapp, Lothar Sebastian, et al.
Published: (2024)

Improved bounds for acyclic coloring parameters
by: Kirousis, Lefteris, et al.
Published: (2022)

Description Complexity of Unary Structures in First-Order Logic with Links to Entropy
by: Jaakkola, Reijo, et al.
Published: (2024)