Independent Sets in Asteroidal Triple-Free Graphs
From MaRDI portal
Recommendations
Cited in
(48)- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs
- A generalization of AT-free graphs and a generic algorithm for solving triangulation problems
- On linear and circular structure of (claw, net)-free graphs
- Induced matchings in asteroidal triple-free graphs
- Algorithms for graphs with small octopus
- Induced matchings in intersection graphs.
- On claw-free asteroidal triple-free graphs
- Notes on complexity of packing coloring
- 3-colouring AT-free graphs in polynomial time
- Closing complexity gaps for coloring problems on \(H\)-free graphs
- On the complexity of the independent set problem in triangle graphs
- The complexity of dissociation set problems in graphs
- The k-separator problem: polyhedra, complexity and approximation results
- Classes of perfect graphs
- On asteroidal sets in chordal graphs
- Improved bottleneck domination algorithms
- Independent packings in structured graphs
- Recognizing graphs without asteroidal triples (Extended abstract)
- Open problems on graph coloring for special graph classes
- Tent and a subclass of \(P_{5}\)-free graphs
- Independent Domination in Triangle Graphs
- On distance-3 matchings and induced matchings
- Reduced clique graphs of chordal graphs
- Asteroidal sets in graphs
- Independent sets in asteroidal triple-free graphs
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- On claw-free asteroidal triple-free graphs
- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs
- Connected domination and steiner set on asteroidal triple-free graphs
- Hereditary efficiently dominatable graphs
- Separator orders in interval, cocomparability, and AT-free graphs
- Connected feedback vertex set on AT-free graphs
- Graphs with at most two moplexes
- Asteroidal sets and dominating paths
- Connected feedback vertex set on AT-free graphs
- On distance-d independent set problems for some graph classes
- Stability in graphs with matroid constraints
- Maximum regular induced subgraphs in 2P₃-free graphs
- Connected vertex cover on AT-free graphs
- Obstructions to faster diameter computation: asteroidal sets
- On distance-3 matchings and induced matchings
- Subset feedback vertex set and subset vertex cover on AT-free graphs
- Outer-planar vertex deletion on AT-free graphs
- Mind the independence gap
- Recognizing graphs without asteroidal triples
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
- Approximability results for the maximum and minimum maximal induced matching problems
- Feedback vertex set on AT-free graphs
This page was built for publication: Independent Sets in Asteroidal Triple-Free Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4255822)