Pages that link to "Item:Q2496203"
From MaRDI portal
The following pages link to Approximating clique-width and branch-width (Q2496203):
Displayed 38 items.
- Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← 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 a disparity between relative cliquewidth and relative NLC-width (Q972344) (← links)
- The rank-width of the square grid (Q972345) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- A little statistical mechanics for the graph theorist (Q973134) (← links)
- Computing rank-width exactly (Q989474) (← links)
- Clique-width of graphs defined by one-vertex extensions (Q998353) (← links)
- Graph operations characterizing rank-width (Q1028455) (← 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)
- Vertex-minor reductions can simulate edge contractions (Q2457014) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Hypertree width and related hypergraph invariants (Q2461773) (← links)
- Solving \#SAT using vertex covers (Q2464035) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
- Linear layouts measuring neighbourhoods in graphs (Q2502893) (← 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)
- The relative clique-width of a graph (Q2642017) (← links)
- Rank-width and Well-quasi-ordering of Skew-symmetric Matrices (Q3439350) (← links)
- Algorithms for Propositional Model Counting (Q3498488) (← links)
- Complexity and Algorithms for Well-Structured k-SAT Instances (Q3502698) (← links)
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions (Q3508555) (← links)
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES (Q3526986) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- Excluding a bipartite circle graph from line graphs (Q3608319) (← links)
- The complexity of the matching-cut problem for planar graphs and other graph classes (Q3652545) (← links)
- Boolean-Width of Graphs (Q3656851) (← links)
- The Rank-Width of the Square Grid (Q5302058) (← links)
- Distance Hereditary Graphs and the Interlace Polynomial (Q5428369) (← links)