The following pages link to (Q4508369):
Displaying 37 items.
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs (Q415287) (← links)
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs (Q449209) (← links)
- The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- New plain-exponential time classes for graph homomorphism (Q639844) (← links)
- Graphs of linear clique-width at most 3 (Q719287) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- On a disparity between relative cliquewidth and relative NLC-width (Q972344) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- Distance labeling scheme and split decomposition (Q1417571) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. (Q1874383) (← links)
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- Polynomial algorithms for protein similarity search for restricted mRNA structures (Q2380067) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- Vertex-minor reductions can simulate edge contractions (Q2457014) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- Rank-width and vertex-minors (Q2565688) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- On the relationship between NLC-width and linear NLC-width (Q2576869) (← links)
- Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width (Q3007630) (← links)
- Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (Q3010427) (← links)
- New Plain-Exponential Time Classes for Graph Homomorphism (Q3392969) (← links)
- Graphs of Linear Clique-Width at Most 3 (Q3502658) (← links)
- Graph Operations, Graph Transformations and Monadic Second-Order Logic: (Q4923534) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- Inductive computations on graphs defined by clique-width expressions (Q5321781) (← links)
- Dynamic Distance Hereditary Graphs Using Split Decomposition (Q5387744) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
