Pages that link to "Item:Q5360875"
From MaRDI portal
The following pages link to Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs (Q5360875):
Displaying 14 items.
- 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)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991) (← links)
- (Q5111194) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5890917) (← links)
- On efficient domination for some classes of \(H\)-free chordal graphs (Q5918841) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- A class of graphs with large rankwidth (Q6080165) (← links)
