Pages that link to "Item:Q324824"
From MaRDI portal
The following pages link to Efficient and perfect domination on circular-arc graphs (Q324824):
Displaying 10 items.
- Efficient and perfect domination on circular-arc graphs (Q324824) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Efficient reduction for path problems on circular-arc graphs (Q802884) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- Perfect edge domination: hard and solvable cases (Q1639290) (← links)
- Modelling and solving the perfect edge domination problem (Q2174880) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- (Q4897879) (← links)
- Parameterized Domination in Circle Graphs (Q5200517) (← links)
- Graphs whose vertices of degree at least 2 lie in a triangle (Q6667338) (← links)