Pages that link to "Item:Q1209148"
From MaRDI portal
The following pages link to The complexity of domination problems in circle graphs (Q1209148):
Displaying 34 items.
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Independence and domination in polygon graphs (Q686246) (← links)
- An output sensitive algorithm for computing a maximum independent set of a circle graph (Q765500) (← links)
- Semitotal domination on AT-free graphs and circle graphs (Q831692) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- APX-hardness of domination problems in circle graphs (Q1045943) (← links)
- On total \(f\)-domination: polyhedral and algorithmic results (Q1732100) (← links)
- Domination and total domination on asteroidal triple-free graphs (Q1962038) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Dominating sets reconfiguration under token sliding (Q2032965) (← links)
- Defensive alliances in graphs (Q2079875) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Strong edge coloring of circle graphs (Q2122690) (← links)
- Algorithmic results in secure total dominating sets on graphs (Q2136269) (← links)
- TS-reconfiguration of dominating sets in circle and circular-arc graphs (Q2140491) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Algorithmic results on double Roman domination in graphs (Q2292130) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- On connected dominating sets of restricted diameter (Q2356248) (← links)
- Subtree filament graphs are subtree overlap graphs (Q2380028) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- Algorithmic Aspects of Disjunctive Total Domination in Graphs (Q2958321) (← links)
- Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
- Maximum Independent Set in 2-Direction Outersegment Graphs (Q3104773) (← links)
- Connected Domination (Q3384607) (← links)
- (Q5115821) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
- A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs (Q5261054) (← links)
- Algorithmic aspects of k-part degree restricted domination in graphs (Q5858166) (← links)
- Algorithmic results on locating-total domination in graphs (Q6157416) (← links)
- Algorithmic results in Roman dominating functions on graphs (Q6161427) (← links)
- Algorithmic and complexity aspects of problems related to total restrained domination for graphs (Q6181337) (← links)
- Offensive alliances in graphs (Q6201327) (← links)
