Pages that link to "Item:Q2641288"
From MaRDI portal
The following pages link to The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288):
Displayed 50 items.
- Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams (Q3449205) (← links)
- Provenance Circuits for Trees and Treelike Instances (Q3449465) (← links)
- A New Approach for Contact Graph Representations and Its Applications (Q3449814) (← links)
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width (Q3470112) (← links)
- Distance Constrained Labelings of Trees (Q3502639) (← links)
- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (Q3586006) (← links)
- Towards a characterization of order-invariant queries over tame graphs (Q3616348) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs (Q3656858) (← links)
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) (← links)
- Graph decompositions and tree automata in reasoning with uncertainty (Q4286533) (← links)
- Transforming graph states using single-qubit operations (Q4561771) (← links)
- Dynamic algorithms for graphs of bounded treewidth (Q4571961) (← links)
- Recognizability equals definability for partial k-paths (Q4572008) (← links)
- Graph Bisection with Pareto Optimization (Q4577953) (← links)
- Recognizable languages of arrows and cospans (Q4585008) (← links)
- A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (Q4605514) (← links)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
- Beyond Outerplanarity (Q4625142) (← links)
- (Q4625695) (← links)
- Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity (Q4632210) (← links)
- The size of an intertwine (Q4632453) (← links)
- (Q4638063) (← links)
- Yes, the “missing axiom” of matroid theory is lost forever (Q4642529) (← links)
- Parallel algorithms with optimal speedup for bounded treewidth (Q4645184) (← links)
- The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed (Q4645287) (← links)
- A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths (Q4645295) (← links)
- The definition in monadic second-order logic of modular decompositions of ordered graphs (Q4645296) (← links)
- (Q4691777) (← links)
- (Q4852905) (← links)
- Equivalent definitions of recognizability for sets of graphs of bounded tree-width (Q4882496) (← links)
- Fifty years of the spectrum problem: survey and new results (Q4902770) (← links)
- First order properties on nowhere dense structures (Q4931094) (← links)
- Complexity of Roman {2}-domination and the double Roman domination in graphs (Q4956233) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- (Q5002812) (← links)
- (Q5002820) (← links)
- Reducing CMSO model checking to highly connected graphs (Q5002822) (← links)
- (Q5005129) (← links)
- (Q5009465) (← links)
- Parameterized Leaf Power Recognition via Embedding into Graph Products (Q5009478) (← links)
- (Q5009500) (← links)
- Practical Access to Dynamic Programming on Tree Decompositions (Q5009563) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Algorithmic aspects of total Roman {3}-domination in graphs (Q5025138) (← links)
- (Q5028434) (← links)
- Complexity issues of perfect secure domination in graphs (Q5037201) (← links)
- Iterated Type Partitions (Q5041190) (← links)
- Second-Order Finite Automata (Q5042226) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)