Hereditary efficiently dominatable graphs
From MaRDI portal
Recommendations
Cites work
- 1-perfect codes in Sierpiński graphs
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- A theorem of Truemper
- Claw-free graphs. IV: Decomposition theorem
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
- Difference graphs
- Efficient edge domination on hole-free graphs in polynomial time
- Even and odd holes in cap-free graphs
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- Even-hole-free graphs. I: Decomposition theorem
- Graphs of separability at most 2
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
- scientific article; zbMATH DE number 91051 (Why is no real title available?)
- scientific article; zbMATH DE number 1156657 (Why is no real title available?)
- scientific article; zbMATH DE number 794265 (Why is no real title available?)
- scientific article; zbMATH DE number 975419 (Why is no real title available?)
- scientific article; zbMATH DE number 6783420 (Why is no real title available?)
- Independent Sets in Asteroidal Triple-Free Graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- New graph classes of bounded clique-width
- On maximal independent sets of vertices in claw-free graphs
- On rigid circuit graphs
- Perfect codes and independent dominating sets
- Perfect codes in graphs
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
- Quasi-threshold graphs
- Recurrence among trees with most numerous efficient dominating sets
- Stability number of bull- and chair-free graphs revisited
- The Complexity of the Partial Order Dimension Problem
- The strong perfect graph theorem
- The weighted perfect domination problem and its variants
- Trivially perfect graphs
- Universally signable graphs
- Weighted domination of cocomparability graphs
- Weighted efficient domination problem on some perfect graphs
- Weighted independent perfect domination on cocomparability graphs
Cited in
(20)- A dichotomy for weighted efficient dominating sets with bounded degree vertices
- Weighted efficient domination for some classes of H-free and of (H₁, H₂)-free graphs
- Efficient domination for classes of \(P_6\)-free graphs
- On efficient domination for some classes of H-free bipartite graphs
- A note on efficient domination in a superclass of \(P_5\)-free graphs
- Efficient domination for some subclasses of P₆-free graphs in polynomial time
- On efficient dominating sets in simplicial graphs
- Weighted efficient domination for P₅-free and P₆-free graphs
- Efficient domination through eigenvalues
- Weighted efficient domination for P₆-free and for P₅-free graphs
- Structure of squares and efficient domination in graph classes
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- Efficient domination in Mycielski's graphs
- Exact algorithms for minimum weighted dominating induced matching
- On efficient domination for some classes of \(H\)-free chordal graphs
- On efficient domination for some classes of \(H\)-free chordal graphs
- A study on the weighted efficient domination problem for C₄-free bipartite graphs
- New characterization of efficient closed and open dominated graphs
- Graph classes with and without powers of bounded clique-width
- Weighted efficient domination in two subclasses of P₆-free graphs
This page was built for publication: Hereditary efficiently dominatable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325951)
