Pages that link to "Item:Q2874563"
From MaRDI portal
The following pages link to The point-set embeddability problem for plane graphs (Q2874563):
Displaying 16 items.
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
- Mim-width. I. Induced path problems (Q2174563) (← links)
- List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
- Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees (Q2396907) (← links)
- Lower bounds on the mim-width of some graph classes (Q2413964) (← links)
- On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
- (Q5009468) (← links)
- (Q5075752) (← links)
- (Q5092403) (← links)
- (Q5111880) (← links)
- Plane 3-Trees: Embeddability and Approximation (Q5251619) (← links)
- The perfect matching cut problem revisited (Q5918785) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- Branchwidth is \((1, g)\)-self-dual (Q6126712) (← links)
- Excluding a planar matching minor in bipartite graphs (Q6144397) (← links)
