On the clique-width of some perfect graph classes
From MaRDI portal
(Redirected from Publication:5249049)
Recommendations
Cites work
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
- Completely separable graphs
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Handle-rewriting hypergraph grammars
- Linear time solvable optimization problems on graphs of bounded clique-width
- On the clique-width of graph with few \(P_{4}\)'s
- Restricted unimodular chordal graphs
- Upper bounds to the clique width of graphs
Cited in
(only showing first 100 items - show all)- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- Graphs vertex-partitionable into strong cliques
- On spectra of sentences of monadic second order logic with counting
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- Clique-width of full bubble model graphs
- Bounding clique-width via perfect graphs
- On using SAT solvers for graph computations
- On the maximum cardinality cut problem in proper interval graphs and related graph classes
- Linear Recurrence Relations for Graph Polynomials
- Word-representable graphs and locality of words
- On distance-3 matchings and induced matchings
- Rank-width and vertex-minors
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
- Dominating induced matchings
- The simultaneous interval number: a new width parameter that measures the similarity to interval graphs
- Clique-width of graph classes defined by two forbidden induced subgraphs
- Between clique-width and linear clique-width of bipartite graphs
- Succinct data structures for bounded clique-width graphs
- Rooted directed path graphs are leaf powers
- Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
- The complexity of the matching-cut problem for planar graphs and other graph classes
- A polynomial-time approximation to a minimum dominating set in a graph
- Bounding the clique-width of H-free chordal graphs
- Distance-hereditary graphs are clique-perfect
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
- Simple linear-time algorithms for counting independent sets in distance-hereditary graphs
- Stability number of bull- and chair-free graphs revisited
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
- Clique-width of graphs defined by one-vertex extensions
- The behavior of clique-width under graph operations and graph transformations
- Graph parameters measuring neighbourhoods in graphs-bounds and applications
- Split permutation graphs
- Polynomial algorithms for protein similarity search for restricted mRNA structures
- Optimal centrality computations within bounded clique-width graphs
- Domination and convexity problems in the target set selection model
- A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- The iteration time and the general position number in graph convexities
- Sparse graphs of twin-width 2 have bounded tree-width
- Finding clubs in graph classes
- Clique-width of path powers
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
- Solving problems on generalized convex graphs via mim-width
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
- On the hardness of generalized domination problems parameterized by mim-width
- Computing densest \(k\)-subgraph with structural parameters
- Boundary properties of graphs for algorithmic graph problems
- Algorithmic uses of the Feferman-Vaught theorem
- Minimal classes of graphs of unbounded clique-width
- Characterization of classical graph classes by weighted clique graphs
- A new representation of proper interval graphs with an application to clique-width
- Dynamic monopolies for interval graphs with bounded thresholds
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
- Polynomial-time recognition of clique-width 3 graphs
- On strict (outer-)confluent graphs
- The carving-width of generalized hypercubes
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- On strict (outer-)confluent graphs
- Vertex disjoint paths on clique-width bounded graphs
- Recent developments on graphs of bounded clique-width
- Twin-distance-hereditary digraphs
- Tree-width and the monadic quantifier hierarchy.
- A note on connected dominating sets of distance-hereditary graphs
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width
- On distance preserving and sequentially distance preserving graphs
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond
- Conflict-free coloring: graphs of bounded clique-width and intersection graphs
- b-coloring parameterized by clique-width
- On the computational complexity of the bipartizing matching problem
- Compact representation of graphs of small clique-width
- Faster algorithms for vertex partitioning problems parameterized by clique-width
- Edge dominating set and colorings on graphs with fixed clique-width
- Graph functionality
- Knocking out \(P_k\)-free graphs
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- Clique-width and well-quasi-ordering of triangle-free graph classes
- Counting homomorphisms in plain exponential time
- Clique-width and edge contraction
- On powers of graphs of bounded NLC-width (clique-width)
- Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
- On factorial properties of chordal bipartite graphs
- Perfect Roman domination: aspects of enumeration and parameterization
- Clique-width of countable graphs: A compactness property.
- Computing the clique-width of large path powers in linear time via a new characterisation of clique-width
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Mim-width. II. The feedback vertex set problem
- The complexity of finding uniform sparsest cuts in various graph classes
- Bounding clique-width via perfect graphs
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- Boolean-width of graphs
- Bounding the clique-width of \(H\)-free split graphs
- Comparing linear width parameters for directed graphs
- Coloring rings
- Solving \#SAT using vertex covers
- Solving problems on generalized convex graphs via mim-width
- On the thinness and proper thinness of a graph
- A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs
This page was built for publication: On the clique-width of some perfect graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249049)
