Pages that link to "Item:Q4255822"
From MaRDI portal
The following pages link to Independent Sets in Asteroidal Triple-Free Graphs (Q4255822):
Displaying 35 items.
- Tent and a subclass of \(P_{5}\)-free graphs (Q327628) (← links)
- Reduced clique graphs of chordal graphs (Q412263) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- Mind the independence gap (Q776261) (← links)
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- Feedback vertex set on AT-free graphs (Q944750) (← links)
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- Algorithms for graphs with small octopus (Q1421464) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- On claw-free asteroidal triple-free graphs (Q1613398) (← links)
- Notes on complexity of packing coloring (Q1641149) (← links)
- 3-colouring AT-free graphs in polynomial time (Q1934316) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- On asteroidal sets in chordal graphs (Q2448883) (← links)
- Improved bottleneck domination algorithms (Q2499580) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Independent Domination in Triangle Graphs (Q3439603) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs (Q5025046) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- Graphs with at most two moplexes (Q6595515) (← links)
- Asteroidal sets and dominating paths (Q6606182) (← links)
- Connected feedback vertex set on AT-free graphs (Q6658085) (← links)
