Independent domination in finitely defined classes of graphs
From MaRDI portal
Publication:1399990
DOI10.1016/S0304-3975(02)00586-8zbMATH Open1028.68061MaRDI QIDQ1399990FDOQ1399990
Publication date: 30 July 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Modular decomposition and transitive orientation
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Handle-rewriting hypergraph grammars
- Domination on Cocomparability Graphs
- A New Algorithm for Generating All the Maximal Independent Sets
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- On maximal independent sets of vertices in claw-free graphs
- On domination problems for permutation and other graphs
- Domination in convex and chordal bipartite graphs
- Title not available (Why is that?)
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
- On graphs with polynomially solvable maximum-weight clique problem
- Some classes of perfectly orderable graphs
- Title not available (Why is that?)
- Independent domination in chordal graphs
- Title not available (Why is that?)
- ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S
- Bipartite graphs without a skew star
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
- On the vertex packing problem
- Title not available (Why is that?)
- On semi-\(P_ 4\)-sparse graphs
- A nice class for the vertex packing problem
Cited In (21)
- Independent domination in outerplanar graphs
- Independent perfect domination sets in Cayley graphs
- Satgraphs and independent domination. I
- Title not available (Why is that?)
- Boundary Classes of Planar Graphs
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- Independent domination versus weighted independent domination
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- On the independent dominating set polytope
- Independent domination in finitely defined classes of graphs: polynomial algorithms
- NP-hard graph problems and boundary classes of graphs
- Independent domination in directed graphs
- Independent sets with domination constraints
- Chordal bipartite graphs of bounded tree- and clique-width
- Mind the independence gap
- Independent domination in hereditary classes
- More results on weighted independent domination
- Tree-Width and Optimization in Bounded Degree Graphs
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds
- Independent dominating sets in triangle-free graphs
This page was built for publication: Independent domination in finitely defined classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399990)
