Pages that link to "Item:Q5249049"
From MaRDI portal
The following pages link to ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES (Q5249049):
Displayed 50 items.
- Clique-width of path powers (Q266933) (← links)
- Finding clubs in graph classes (Q400518) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- On the model-checking of monadic second-order formulas with edge set quantifications (Q415286) (← links)
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs (Q415287) (← links)
- A note on connected dominating sets of distance-hereditary graphs (Q423975) (← links)
- On factorial properties of chordal bipartite graphs (Q442348) (← links)
- The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
- Clique-width with an inactive label (Q465271) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs (Q477199) (← links)
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Boundary properties of graphs for algorithmic graph problems (Q551178) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- The carving-width of generalized hypercubes (Q710586) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Compact representation of graphs of small clique-width (Q724221) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Graph parameters measuring neighbourhoods in graphs-bounds and applications (Q944739) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Rooted directed path graphs are leaf powers (Q965972) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Clique-width of graphs defined by one-vertex extensions (Q998353) (← links)
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- Independent domination in finitely defined classes of graphs (Q1399990) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548) (← links)
- Induced minor free graphs: isomorphism and clique-width (Q1702118) (← links)
- Simple linear-time algorithms for counting independent sets in distance-hereditary graphs (Q1706124) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- Dynamic monopolies for interval graphs with bounded thresholds (Q1741518) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- Split permutation graphs (Q2014716) (← links)
- Cluster deletion on interval graphs and split related graphs (Q2037103) (← links)
- On the maximum cardinality cut problem in proper interval graphs and related graph classes (Q2055967) (← links)
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited (Q2067672) (← 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)