Pages that link to "Item:Q2506362"
From MaRDI portal
The following pages link to Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362):
Displaying 11 items.
- Max point-tolerance graphs (Q344833) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- Minimum weight feedback vertex sets in circle graphs (Q963384) (← links)
- Generalised online colouring problems in overlap graphs (Q2034796) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Subtree filament graphs are subtree overlap graphs (Q2380028) (← links)
- On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- MINIMUM WEIGHT FEEDBACK VERTEX SETS IN CIRCLE n-GON GRAPHS AND CIRCLE TRAPEZOID GRAPHS (Q2890989) (← links)
- (Q5088986) (← links)
