Counting \(H-\)colorings of partial \(k-\)trees (Q1603695): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273870
@@ Property / cites work: Q4273870 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for the Tutte polynomials of graphs of bounded treewidth
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Q4699283
@@ Property / cites work: Q4699283 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
+Normal rank
@@ Property / cites work @@
+On Approximately Counting Colorings of Small Degree Graphs
+Normal rank
@@ Property / cites work @@
+On Markov Chains for Randomly H-Coloring a Graph
@@ Property / cites work: On Markov Chains for Randomly H-Coloring a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
+Normal rank
@@ Property / cites work @@
+On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
+Normal rank
@@ Property / cites work @@
+Q4952624
@@ Property / cites work: Q4952624 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of colouring problems on dense graphs
+Normal rank
@@ Property / cites work @@
+List homomorphisms to reflexive graphs
@@ Property / cites work: List homomorphisms to reflexive graphs / rank @@
+Normal rank
@@ Property / cites work @@
+List homomorphisms and circular arc graphs
@@ Property / cites work: List homomorphisms and circular arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of \(H\)-colouring of bounded degree graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+The core of a graph
@@ Property / cites work: The core of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
+Normal rank
@@ Property / cites work @@
+Algorithms finding tree-decompositions of graphs
@@ Property / cites work: Algorithms finding tree-decompositions of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Aspects of structural combinatorics. (Graph homomorphisms and their use)
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Q3684139
@@ Property / cites work: Q3684139 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank