scientific article; zbMATH DE number 1512682
From MaRDI portal
Publication:4508369
Cited in
(38)- Graph operations characterizing rank-width
- Tree-width and the monadic quantifier hierarchy.
- Distance labeling scheme and split decomposition
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Edge dominating set and colorings on graphs with fixed clique-width
- The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions.
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
- Optimal centrality computations within bounded clique-width graphs
- Polynomial algorithms for protein similarity search for restricted mRNA structures
- The rank-width of edge-coloured graphs
- Vertex-minor reductions can simulate edge contractions
- Line graphs of bounded clique-width
- Counting truth assignments of formulas of bounded tree-width or clique-width
- Approximating clique-width and branch-width
- Vertex disjoint paths on clique-width bounded graphs
- Rank-width and vertex-minors
- The recognizability of sets of graphs is a robust property
- On the relationship between NLC-width and linear NLC-width
- Computing the clique-width of large path powers in linear time via a new characterisation of clique-width
- Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
- New Plain-Exponential Time Classes for Graph Homomorphism
- scientific article; zbMATH DE number 6503350 (Why is no real title available?)
- Graphs of Linear Clique-Width at Most 3
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- Polynomial-time recognition of clique-width 3 graphs
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs
- The complexity of finding uniform sparsest cuts in various graph classes
- Graph operations, graph transformations and monadic second-order logic: a survey
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Inductive computations on graphs defined by clique-width expressions
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- Algorithmic uses of the Feferman-Vaught theorem
- New plain-exponential time classes for graph homomorphism
- Graphs of linear clique-width at most 3
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- On a disparity between relative cliquewidth and relative NLC-width
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508369)
