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 21 items.
- 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)
- (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)
- A Practical Approach to Courcelle's Theorem (Q5170276) (← links)
- A linear‐time algorithm for broadcast domination in a tree (Q5191137) (← links)
- On spectra of sentences of monadic second order logic with counting (Q5311744) (← links)
- Identifying Codes in Line Graphs (Q5325952) (← links)
- Optimization and Recognition for K 5-minor Free Graphs in Linear Time (Q5458529) (← links)
- Clique-perfectness of complements of line graphs (Q5891101) (← links)
- Grid structures and undecidable constraint theories (Q5941204) (← links)
- The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246) (← links)
- Computing LOGCFL certificates (Q5958329) (← links)