Pages that link to "Item:Q4377448"
From MaRDI portal
The following pages link to Algorithms for Vertex Partitioning Problems on Partial k-Trees (Q4377448):
Displaying 50 items.
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- An improved upper bound on the total restrained domination number in cubic graphs (Q1926030) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Cluster deletion on interval graphs and split related graphs (Q2037103) (← links)
- Restrained condition on double Roman dominating functions (Q2096308) (← links)
- Star colouring of bounded degree graphs and regular graphs (Q2124639) (← links)
- Restrained and total restrained domination in cographs (Q2151385) (← links)
- Mim-width. I. Induced path problems (Q2174563) (← links)
- Grundy coloring in some subclasses of bipartite graphs and their complements (Q2203596) (← links)
- Restrained domination in self-complementary graphs (Q2227117) (← links)
- \(F_3\)-domination problem of graphs (Q2251138) (← links)
- Total restrained domination in claw-free graphs (Q2268763) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
- The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← links)
- Restrained domination in some subclasses of chordal graphs (Q2413358) (← links)
- On the Grundy number of Cameron graphs (Q2413405) (← links)
- Certifying coloring algorithms for graphs without long induced paths (Q2414471) (← links)
- When an optimal dominating set with given constraints exists (Q2420615) (← links)
- Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- Algorithmic aspect of stratified domination in graphs (Q2445324) (← links)
- Faster algorithms for vertex partitioning problems parameterized by clique-width (Q2447760) (← links)
- The product of the restrained domination numbers of a graph and its complement (Q2452393) (← links)
- On equality in an upper bound for the restrained and total domination numbers of a graph (Q2461210) (← links)
- Trees with equal domination and restrained domination numbers (Q2494314) (← links)
- Worm colorings (Q2516682) (← links)
- The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing (Q2661539) (← links)
- On b-acyclic chromatic number of a graph (Q2685280) (← links)
- The restrained domination and independent restrained domination in extending supergrid graphs (Q2695306) (← links)
- Restrained domination and its variants in extended supergrid graphs (Q2699221) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← links)
- A \(c^k n\) 5-approximation algorithm for treewidth (Q2799353) (← links)
- Tree partitioning via vertex deletion (Q2816023) (← links)
- Grundy number on \(P_4\)-classes (Q2840510) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- On the Boolean-Width of a Graph: Structure and Applications (Q3057622) (← links)
- Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) (← links)
- Restrained and Total Restrained Domination in Graphs (Q3384608) (← links)
- Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity (Q3502644) (← links)
- Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs (Q3508549) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- Restrained bondage number of a graph (Q3561530) (← links)
- (Q3611470) (← links)
- Characterizations of trees with equal domination parameters (Q4489489) (← links)
- More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
