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 31 items.
- (Q5009468) (← links)
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
- Fast Algorithms for Join Operations on Tree Decompositions (Q5042462) (← links)
- Memory requirements for table computations in partial k-tree algorithms (Q5054858) (← links)
- Practical algorithms on partial k-trees with an application to domination-like problems (Q5060153) (← links)
- Results on Total Restrained Domination number and subdivision number for certain graphs (Q5069711) (← links)
- (Q5075752) (← links)
- (Q5092370) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5111880) (← links)
- A POLYNOMIAL-TIME ALGORITHM FOR FINDING TOTAL COLORINGS OF PARTIAL k-TREES (Q5248998) (← links)
- A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs (Q5261054) (← links)
- (Q5374243) (← links)
- Dynamic programming for graphs on surfaces (Q5501962) (← links)
- (Q5874480) (← links)
- Complexity of fall coloring for restricted graph classes (Q5918283) (← links)
- The perfect matching cut problem revisited (Q5918785) (← links)
- The perfect matching cut problem revisited (Q5925551) (← links)
- The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246) (← links)
- An inequality that relates the size of a bipartite graph with its order and restrained domination number (Q5963608) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Strong restrained domination number on trees and product of graphs: An algorithmic approach (Q6059097) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- Restrained {2}-domination in graphs (Q6140951) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- Grundy number of corona product of some graphs (Q6184224) (← links)
- Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)
- A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph (Q6611042) (← links)
- \(b\)-coloring parameterized by clique-width (Q6614620) (← links)
- Parameterized problems complete for nondeterministic FPT time and logarithmic space (Q6614886) (← links)
