Pages that link to "Item:Q3077955"
From MaRDI portal
The following pages link to Graph structure and monadic second-order logic. A language-theoretic approach (Q3077955):
Displaying 50 items.
- (Q5021228) (← links)
- (Q5028434) (← links)
- (Q5028484) (← links)
- Induced betweenness in order-theoretic trees (Q5038203) (← links)
- Order-theoretic Trees: Monadic Second-order Descriptions and Regularity (Q5038567) (← links)
- On the Tutte and Matching Polynomials for Complete Graphs (Q5038571) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs (Q5043646) (← links)
- Betweenness in Order-Theoretic Trees (Q5049040) (← links)
- Harary polynomials (Q5056203) (← links)
- Acyclic polynomials of graphs (Q5080911) (← links)
- Convolution and concurrency (Q5084483) (← links)
- (Q5089180) (← links)
- (Q5090448) (← links)
- (Q5090956) (← links)
- Origin-equivalence of two-way word transducers is in PSPACE (Q5090958) (← links)
- (Q5091268) (← links)
- (Q5092324) (← links)
- (Q5092419) (← links)
- On Synthesis of Resynchronizers for Transducers (Q5092432) (← links)
- Generating Posets Beyond N (Q5098715) (← links)
- Algebras for Tree Decomposable Graphs (Q5100734) (← links)
- \(K_4\)-free graphs as a free algebra (Q5111293) (← links)
- Towards an Efficient Tree Automata based technique for Timed Systems (Q5111654) (← links)
- Partial complementation of graphs (Q5116485) (← links)
- (Q5116488) (← links)
- Finer Tight Bounds for Coloring on Clique-Width (Q5130905) (← links)
- Bundled Crossings Revisited (Q5141645) (← links)
- Fly-Automata, Their Properties and Applications (Q5200070) (← links)
- Network-Based Vertex Dissolution (Q5254088) (← links)
- Where First-Order and Monadic Second-Order Logic Coincide (Q5278195) (← links)
- Parametrised Complexity of Satisfiability in Temporal Logic (Q5278205) (← links)
- The monadic second-order logic of graphs XVI : Canonical graph decompositions (Q5310655) (← links)
- (Q5856407) (← links)
- Axiomatization of betweenness in order-theoretic trees (Q5856415) (← links)
- A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions (Q5875940) (← links)
- Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs (Q5890507) (← links)
- Computing with tangles (Q5890774) (← links)
- The Parameterized Complexity of Graph Cyclability (Q5891809) (← links)
- Properties of graphs specified by a regular language (Q5896894) (← links)
- An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width (Q5918121) (← links)
- Streaming ranked-tree-to-string transducers (Q5918275) (← links)
- Feedback edge sets in temporal graphs (Q5918410) (← links)
- Clique-width of point configurations (Q5918571) (← links)
- Properties of graphs specified by a regular language (Q5918788) (← links)
- Clique-perfectness of complements of line graphs (Q5919747) (← links)
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5920195) (← links)
- On \(H\)-topological intersection graphs (Q5925535) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
