Pages that link to "Item:Q832860"
From MaRDI portal
The following pages link to Solving problems on generalized convex graphs via mim-width (Q832860):
Displaying 8 items.
- Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
- M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem (Q5470828) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs (Q6064836) (← links)
- On convexity in split graphs: complexity of Steiner tree and domination (Q6123388) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)
- List 3-coloring on comb-convex and caterpillar-convex bipartite graphs (Q6591467) (← links)
