The following pages link to (Q4448752):
Displayed 50 items.
- Graphs of separability at most 2 (Q415268) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- On switching classes, NLC-width, cliquewidth and treewidth (Q418754) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Characterizations for restricted graphs of NLC-width 2 (Q870845) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Directed NLC-width (Q906393) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth (Q987381) (← links)
- Oriented coloring on recursively defined digraphs (Q2003341) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- Minimum maximal matchings in cubic graphs (Q2144321) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (Q2311126) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Knocking out \(P_k\)-free graphs (Q2352787) (← links)
- Polynomial algorithms for protein similarity search for restricted mRNA structures (Q2380067) (← links)
- On powers of graphs of bounded NLC-width (clique-width) (Q2383546) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Parameterized edge Hamiltonicity (Q2413968) (← links)
- Obstructions for linear rank-width at most 1 (Q2442201) (← links)
- Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- Computing maximum stable sets for distance-hereditary graphs (Q2568337) (← links)
- On the relationship between NLC-width and linear NLC-width (Q2576869) (← links)
- Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes (Q2819509) (← links)
- Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
- Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Colouring square-free graphs without long induced paths. (Q3304134) (← links)
- (Q3304141) (← links)
- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract) (Q3503637) (← links)
- (Q4625695) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)