Pages that link to "Item:Q3188853"
From MaRDI portal
The following pages link to Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth (Q3188853):
Displaying 13 items.
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- Counting independent sets in tree convex bipartite graphs (Q730492) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs (Q1099628) (← links)
- Constrained domatic bipartition on trees (Q1751203) (← links)
- Maximum weight induced matching in some subclasses of bipartite graphs (Q2023124) (← links)
- Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy (Q2165280) (← links)
- Tractable connected domination for restricted bipartite graphs (Q2354310) (← links)
- Independent Domination on Tree Convex Bipartite Graphs (Q2897988) (← links)
- Union Closed Tree Convex Sets (Q3452566) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- On the Treewidth and Pathwidth of Biconvex Bipartite Graphs (Q5425437) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)