Pages that link to "Item:Q5696971"
From MaRDI portal
The following pages link to GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH (Q5696971):
Displaying 23 items.
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- On minimal prime extensions of a four-vertex graph in a prime graph (Q704276) (← links)
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- A local characterization of bounded clique-width for line graphs (Q868337) (← links)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← 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)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- List coloring in the absence of two subgraphs (Q2636800) (← links)
- Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
- Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes (Q2819509) (← 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)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- (Q5111290) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← 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)