Pages that link to "Item:Q858683"

The following pages link to Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683):

Displaying 44 items.

• Tree-depth and vertex-minors (Q281932) (← links)
• Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
• Block-graph width (Q534563) (← links)
• Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
• Excluded vertex-minors for graphs of linear rank-width at most \(k\) (Q740279) (← links)
• Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
• MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
• Measurement-based quantum computation and undecidable logic (Q930147) (← links)
• Circle graphs and monadic second-order logic (Q946577) (← links)
• \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
• Solving problems on graphs of high rank-width (Q1709595) (← links)
• Obstructions for bounded shrub-depth and rank-depth (Q2033913) (← links)
• Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
• The grid theorem for vertex-minors (Q2099410) (← links)
• Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
• Subgraph complementation (Q2182091) (← links)
• Rabin's theorem in the concurrency setting: a conjecture (Q2253187) (← links)
• The rank-width of edge-coloured graphs (Q2392245) (← links)
• Rank-width: algorithmic and structural results (Q2403788) (← links)
• An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
• Vertex-minor reductions can simulate edge contractions (Q2457014) (← links)
• The monadic second-order logic of graphs. XV: On a conjecture by D. Seese (Q2494727) (← links)
• A model-theoretic characterisation of clique width (Q2503407) (← links)
• Rank-width and vertex-minors (Q2565688) (← links)
• Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) (Q2692778) (← links)
• Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
• $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs (Q3014938) (← links)
• Simple monadic theories and indiscernibles (Q3077403) (← links)
• Digraphs of Bounded Width (Q3120441) (← links)
• Simple monadic theories and partition width (Q3170562) (← links)
• Transforming graph states using single-qubit operations (Q4561771) (← links)
• Scattered Classes of Graphs (Q4959761) (← links)
• (Q5089253) (← links)
• Counting single-qubit Clifford equivalent graph states is #P-complete (Q5110740) (← links)
• Partial complementation of graphs (Q5116485) (← links)
• 2007 European Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '07 (Q5387300) (← links)
• Directed Nowhere Dense Classes of Graphs (Q5417630) (← links)
• (Q5874521) (← links)
• Computing with tangles (Q5890774) (← links)
• Vertex-minors of graphs: a survey (Q6495258) (← links)
• Fast FPT-approximation of branchwidth (Q6593764) (← links)
• Transducing paths in graph classes with unbounded shrubdepth (Q6614398) (← links)
• MSO undecidability for hereditary classes of unbounded clique-width (Q6614399) (← links)
• Stable graphs of bounded twin-width (Q6649471) (← links)