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 49 items.
- 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)
- 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)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← 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)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← 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)
- Polynomial algorithms for protein similarity search for restricted mRNA structures (Q2380067) (← links)
- On powers of graphs of bounded NLC-width (clique-width) (Q2383546) (← links)
- Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Solving \#SAT using vertex covers (Q2464035) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- Equistable distance-hereditary graphs (Q2473043) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- Distance-hereditary graphs are clique-perfect (Q2489948) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- Rank-width and vertex-minors (Q2565688) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- Rebuilding convex sets in graphs (Q2566140) (← links)
- On the relationship between NLC-width and linear NLC-width (Q2576869) (← links)
- Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width (Q3007630) (← links)
- Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (Q3010427) (← links)
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES (Q3526986) (← links)
- The complexity of the matching-cut problem for planar graphs and other graph classes (Q3652545) (← links)
- Dominating Induced Matchings (Q3655141) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- On spectra of sentences of monadic second order logic with counting (Q5311744) (← links)
- Linear Recurrence Relations for Graph Polynomials (Q5452182) (← links)
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers (Q5458553) (← links)
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH (Q5696971) (← links)