Pages that link to "Item:Q967317"
From MaRDI portal
The following pages link to Recent developments on graphs of bounded clique-width (Q967317):
Displaying 50 items.
- Exact solutions for latency-bounded target set selection problem on some special families of graphs (Q260041) (← links)
- The VC-dimension of graphs with respect to \(k\)-connected subgraphs (Q335348) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Well-quasi-order of relabel functions (Q603891) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
- Compact representation of graphs of small clique-width (Q724221) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
- Eigenvalue location in graphs of small clique-width (Q1625480) (← links)
- Induced minor free graphs: isomorphism and clique-width (Q1702118) (← links)
- Computational complexity of the vertex cover problem in the class of planar triangulations (Q1744983) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558) (← links)
- Split permutation graphs (Q2014716) (← links)
- The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs (Q2025100) (← links)
- On subgraph complementation to \(H\)-free Graphs (Q2088585) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Subgraph complementation and minimum rank (Q2121776) (← links)
- The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring (Q2173433) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- Subgraph complementation (Q2182091) (← links)
- Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
- The Small Set Vertex expansion problem (Q2232595) (← links)
- List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (Q2311126) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Clique-width and edge contraction (Q2350597) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- On compiling structured CNFs to OBDDs (Q2411046) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs (Q2661217) (← links)
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991) (← links)
- The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor (Q2662350) (← links)
- On subgraph complementation to \(H\)-free graphs (Q2672430) (← links)
- Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
- A Boundary Property for Upper Domination (Q2819507) (← 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)
- Linear Clique‐Width for Hereditary Classes of Cographs (Q2978187) (← links)
- Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width (Q3007630) (← links)
- $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs (Q3014938) (← links)
