Domination and total domination on asteroidal triple-free graphs
From MaRDI portal
DOI10.1016/S0166-218X(99)00128-6zbMATH Open0943.05063WikidataQ127343082 ScholiaQ127343082MaRDI QIDQ1962038FDOQ1962038
Publication date: 30 August 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- Computing a dominating pair in an asteroidal triple-free graph in linear time
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
- Independent sets in asteroidal triple-free graphs
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs
- Connected domination and steiner set on asteroidal triple-free graphs
Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Clustering and domination in perfect graphs
- Domination on Cocomparability Graphs
- Complexity of Finding Embeddings in a k-Tree
- Asteroidal Triple-Free Graphs
- Dominating sets in perfect graphs
- Total domination and transformation
- An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs
- The NP-completeness column: An ongoing guide
- Domination, independent domination, and duality in strongly chordal graphs
- Computing the Minimum Fill-In is NP-Complete
- Introduction to ``Topics on Domination
- On Hadwiger's Number and the Stability Number
- Labeling algorithms for domination problems in sun-free chordal graphs
- The complexity of domination problems in circle graphs
- Domination in permutation graphs
- Independence and domination in polygon graphs
- Independent sets in asteroidal triple-free graphs
- Connected domination and steiner set on asteroidal triple-free graphs
- A linear time algorithm to compute a dominating path in an AT-free graph
Cited In (30)
- Induced disjoint paths in AT-free graphs
- Semitotal domination on AT-free graphs and circle graphs
- Edge-dominating trails in AT-free graphs (extended abstract)
- On conditional covering problem
- On claw-free asteroidal triple-free graphs
- A survey of selected recent results on total domination in graphs
- On the Minimum Eccentricity Shortest Path Problem
- Vertex ranking of asteroidal triple-free graphs
- Complexity of paired domination in at-free and planar graphs
- Efficient algorithms for Roman domination on some classes of graphs
- On the minimum eccentricity shortest path problem
- Asteroidal sets and dominating paths
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- The diameter of AT‐free graphs
- Algorithms for graphs with small octopus
- A complexity dichotomy and a new boundary class for the dominating set problem
- Connected feedback vertex set on AT-free graphs
- Independent sets in asteroidal triple-free graphs
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
- Complexity of paired domination in AT-free and planar graphs
- On the structure of graphs with bounded asteroidal number
- Domination problems on P5-free graphs
- Matching properties in total domination vertex critical graphs
- A generalization of AT-free graphs and a generic algorithm for solving triangulation problems
- Connected feedback vertex set on AT-free graphs
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size
- Connected domination and steiner set on asteroidal triple-free graphs
- Title not available (Why is that?)
- On the structure of graphs with bounded asteroidal number
This page was built for publication: Domination and total domination on asteroidal triple-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962038)
