The following pages link to (Q4425939):
Displaying 31 items.
- Graphs of separability at most 2 (Q415268) (← links)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- A new graph construction of unbounded clique-width (Q509276) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← 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)
- Complexity classification of the edge coloring problem for a family of graph classes (Q1675533) (← links)
- Induced minor free graphs: isomorphism and clique-width (Q1702118) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- On the structure of graphs without claw, \(4K_1\) and co-R (Q2158304) (← links)
- Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations (Q2181243) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← 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)
- Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
- (Q5111290) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Critical elements in combinatorially closed families of graph classes (Q5269161) (← links)
- (Q5878618) (← links)
- (Q5884490) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
