On the clique-width of some perfect graph classes
From MaRDI portal
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)- Clique-width with an inactive label
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- Recent developments on graphs of bounded clique-width
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers
- Split permutation graphs
- Clique-width of countable graphs: A compactness property.
- Boundary properties of graphs for algorithmic graph problems
- On the computational complexity of the bipartizing matching problem
- A polynomial-time approximation to a minimum dominating set in a graph
- Solving problems on generalized convex graphs via mim-width
- Automata for the verification of monadic second-order graph properties
- A note on connected dominating sets of distance-hereditary graphs
- Circle graphs and monadic second-order logic
- Rebuilding convex sets in graphs
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Clique-width of graphs defined by one-vertex extensions
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
- Polynomial-time recognition of clique-width \(\leq 3\) graphs
- On the maximum cardinality cut problem in proper interval graphs and related graph classes
- Mim-width. II. The feedback vertex set problem
- Stability number of bull- and chair-free graphs revisited
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- Solving \#SAT using vertex covers
- Graphs vertex-partitionable into strong cliques
- Finding clubs in graph classes
- On factorial properties of chordal bipartite graphs
- Finding a minimum path cover of a distance-hereditary graph in polynomial time
- Vertex disjoint paths on clique-width bounded graphs
- On the model-checking of monadic second-order formulas with edge set quantifications
- A new representation of proper interval graphs with an application to clique-width
- Rank-width and vertex-minors
- On the thinness and proper thinness of a graph
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- Rooted directed path graphs are leaf powers
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- Distance-hereditary graphs are clique-perfect
- NP-hard graph problems and boundary classes of graphs
- On the complexity of the dominating induced matching problem in hereditary classes of graphs
- Clique-width and edge contraction
- Chordal bipartite graphs of bounded tree- and clique-width
- Faster algorithms for vertex partitioning problems parameterized by clique-width
- Counting truth assignments of formulas of bounded tree-width or clique-width
- Equistable distance-hereditary graphs
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Compact representation of graphs of small clique-width
- On the relationship between NLC-width and linear NLC-width
- Algorithmic uses of the Feferman-Vaught theorem
- Independent domination in finitely defined classes of graphs
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
- Comparing linear width parameters for directed graphs
- Open problems on graph coloring for special graph classes
- Linear Recurrence Relations for Graph Polynomials
- The complexity of the matching-cut problem for planar graphs and other graph classes
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- The behavior of clique-width under graph operations and graph transformations
- On distance-3 matchings and induced matchings
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- scientific article; zbMATH DE number 1420904 (Why is no real title available?)
- The carving-width of generalized hypercubes
- Minimal classes of graphs of unbounded clique-width
- Bounding clique-width via perfect graphs
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
- The complexity of finding uniform sparsest cuts in various graph classes
- Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
- On powers of graphs of bounded NLC-width (clique-width)
- Edge dominating set and colorings on graphs with fixed clique-width
- Clique-width of path powers
- Clique-width and well-quasi-ordering of triangle-free graph classes
- Dominating induced matchings
- Line graphs of bounded clique-width
- Dominating induced matchings for \(P_7\)-free graphs in linear time
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
- Computing the clique-width of large path powers in linear time via a new characterisation of clique-width
- Boolean-width of graphs
- Tree-width and the monadic quantifier hierarchy.
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- Optimal centrality computations within bounded clique-width graphs
- Between clique-width and linear clique-width of bipartite graphs
- On strict (outer-)confluent graphs
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width
- Knocking out \(P_k\)-free graphs
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
- On strict (outer-)confluent graphs
- Rank-width: algorithmic and structural results
- Twin-distance-hereditary digraphs
- Cluster deletion on interval graphs and split related graphs
- On efficient domination for some classes of \(H\)-free chordal graphs
- Succinct data structures for bounded clique-width graphs
- Graph parameters measuring neighbourhoods in graphs-bounds and applications
- A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width
- Coloring rings
- Cluster deletion on interval graphs and split related graphs
- Conflict-free coloring: graphs of bounded clique-width and intersection graphs
- Graph functionality
- The NLC-width and clique-width for powers of graphs of bounded tree-width
- \(b\)-coloring parameterized by clique-width
- Bounding the clique-width of \(H\)-free chordal graphs
- Bounding clique-width via perfect 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)
