Pages that link to "Item:Q5249008"
From MaRDI portal
The following pages link to ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S (Q5249008):
Displaying 45 items.
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Independent domination in finitely defined classes of graphs (Q1399990) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- On variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. (Q1853148) (← links)
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- Split permutation graphs (Q2014716) (← 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)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Polynomial algorithms for protein similarity search for restricted mRNA structures (Q2380067) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
- Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
- Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
- Colouring square-free graphs without long induced paths. (Q3304134) (← links)
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES (Q3526986) (← links)
- Dominating Induced Matchings (Q3655141) (← links)
- On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- (Q5111290) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES (Q5249049) (← links)
- On spectra of sentences of monadic second order logic with counting (Q5311744) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5890917) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- \(b\)-coloring parameterized by clique-width (Q6614620) (← links)
