Pages that link to "Item:Q3526986"
From MaRDI portal
The following pages link to THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES (Q3526986):
Displaying 21 items.
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
- A new graph construction of unbounded clique-width (Q509276) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
- Between clique-width and linear clique-width of bipartite graphs (Q2185929) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
- Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5890917) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5918620) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5925628) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
