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.
- Weighted restrained domination in subclasses of planar graphs (Q278718) (← links)
- Equality in a bound that relates the size and the restrained domination number of a graph (Q281803) (← links)
- An upper bound for the total restrained domination number of graphs (Q367057) (← links)
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Total restrained domination in claw-free graphs with minimum degree at least two (Q411852) (← links)
- On the complexity of the bondage and reinforcement problems (Q413470) (← links)
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- NP-completeness and APX-completeness of restrained domination in graphs (Q442103) (← links)
- Minimum order of graphs with given coloring parameters (Q488290) (← links)
- (Total) domination in prisms (Q510330) (← links)
- Splitting trees at vertices (Q616363) (← links)
- On roman, global and restrained domination in graphs (Q659738) (← links)
- Total restrained domination in graphs (Q662204) (← links)
- Restrained domination in cubic graphs (Q719025) (← links)
- Boolean-width of graphs (Q719257) (← links)
- Parameterized power domination complexity (Q844180) (← links)
- Results on the Grundy chromatic number of graphs (Q856867) (← links)
- List homomorphisms of graphs with bounded degrees (Q864125) (← links)
- Total restrained domination in trees (Q879341) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Total restrained domination in graphs with minimum degree two (Q952652) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Partitioning graphs of supply and demand (Q967306) (← links)
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (Q967316) (← links)
- An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree (Q967326) (← links)
- Restrained domination in claw-free graphs with minimum degree at least two (Q968212) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- Restrained bondage in graphs (Q998423) (← links)
- Extension problems with degree bounds (Q1028134) (← links)
- Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth (Q1041722) (← links)
- Total restrained domination in cubic graphs (Q1043826) (← links)
- A survey of stratified domination in graphs (Q1045116) (← links)
- On the equality of the partial Grundy and upper ochromatic numbers of graphs (Q1415544) (← links)
- Iterated colorings of graphs. (Q1427472) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- A width parameter useful for chordal and co-comparability graphs (Q1680525) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- On a conjecture involving a bound for the total restrained domination number of a graph (Q1732113) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- On the Grundy number of graphs with few \(P_4\)'s (Q1759824) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418) (← links)
- Graph separators: A parameterized view (Q1877710) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
