Pages that link to "Item:Q1827785"
From MaRDI portal
The following pages link to Chordal bipartite graphs of bounded tree- and clique-width (Q1827785):
Displaying 21 items.
- On factorial properties of chordal bipartite graphs (Q442348) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Boundary properties of graphs for algorithmic graph problems (Q551178) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- On the bi-enhancement of chordal-bipartite probe graphs (Q991750) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- Between clique-width and linear clique-width of bipartite graphs (Q2185929) (← links)
- On efficient domination for some classes of \(H\)-free bipartite graphs (Q2334041) (← links)
- On compiling structured CNFs to OBDDs (Q2411046) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width (Q3007630) (← links)
- On Compiling Structured CNFs to OBDDs (Q3194709) (← links)
- Tree-Width and Optimization in Bounded Degree Graphs (Q3508553) (← links)
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES (Q3526986) (← links)
- Bounding the Clique‐Width of <i>H</i>‐Free Chordal Graphs (Q5360875) (← links)
- On the Treewidth and Pathwidth of Biconvex Bipartite Graphs (Q5425437) (← links)
- Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded (Q6038594) (← links)
