Pages that link to "Item:Q2424685"
From MaRDI portal
The following pages link to Bounding clique-width via perfect graphs (Q2424685):
Displaying 19 items.
- Query efficient implementation of graphs of bounded clique-width (Q1408820) (← links)
- Computing the clique-width of cactus graphs (Q1744436) (← links)
- Maximizing happiness in graphs of bounded clique-width (Q2081605) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Special issue: Selected papers of the 9th international conference on language and automata theory and applications, LATA 2015 (Q2424669) (← links)
- Clique-width for 4-vertex forbidden subgraphs (Q2432547) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991) (← links)
- Clique width of partner limited graphs (Q2816144) (← links)
- LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs (Q2921429) (← links)
- On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract) (Q3503637) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width (Q5173247) (← links)
- Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs (Q5360875) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- Clique-width of point configurations (Q5918571) (← 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)
