Pages that link to "Item:Q814931"
From MaRDI portal
The following pages link to New graph classes of bounded clique-width (Q814931):
Displaying 30 items.
- Weighted independent sets in classes of \(P_6\)-free graphs (Q298979) (← links)
- A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs (Q344864) (← links)
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- New classes of extremal graphs with given bandwidth (Q489353) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Clique-width of graphs defined by one-vertex extensions (Q998353) (← links)
- The stable set polytope for some extensions of \(P_4\)-free graphs (Q998505) (← links)
- Clique-width of partner-limited graphs (Q1422439) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- The intersection of two vertex coloring problems (Q2303434) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Tractability, hardness, and kernelization lower bound for and/or graph solution (Q2410230) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- Clique-width for 4-vertex forbidden subgraphs (Q2432547) (← links)
- The parametric complexity of graph diameter augmentation (Q2446345) (← links)
- Antimatroids and balanced pairs (Q2454046) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width (Q3007630) (← links)
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES (Q3526986) (← links)
- Linear time solvable optimization problems on graphs of bounded clique width (Q4232773) (← links)
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree (Q4652630) (← links)
- (Q5111290) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)