Counting \(H-\)colorings of partial \(k-\)trees
type: Item
instance of: scholarly article
title: Counting \(H-\)colorings of partial \(k-\)trees
zbMATH Open document ID: 0996.68132
DOI: 10.1016/S0304-3975(02)00017-8
author: Dimitrios M. Thilikos
author: J. Díaz
author: Maria Serna
published in: Theoretical Computer Science
publication date: 2002-07-15T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1767897
zbMATH Keywords: graph homomorphism
zbMATH Keywords: counting problems
zbMATH Keywords: treewidth
MaRDI profile type: Publication
cites work: Q4273870
cites work: An algorithm for the Tutte polynomials of graphs of bounded treewidth
cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: Easy problems for tree-decomposable graphs
cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Q4699283
cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
cites work: On Approximately Counting Colorings of Small Degree Graphs
cites work: On Markov chains for randomly \(H\)-coloring a graph
cites work: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
cites work: Q4952624
cites work: The complexity of colouring problems on dense graphs
cites work: List homomorphisms to reflexive graphs
cites work: List homomorphisms and circular arc graphs
cites work: The complexity of \(H\)-colouring of bounded degree graphs
cites work: Q4198056
cites work: On the complexity of H-coloring
cites work: The core of a graph
cites work: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
cites work: Treewidth. Computations and approximations
cites work: Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
cites work: Algorithms finding tree-decompositions of graphs
cites work: Aspects of structural combinatorics. (Graph homomorphisms and their use)
cites work: Graph minors. I. Excluding a forest
cites work: Graph minors. III. Planar tree-width
cites work: Q3684139
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees
description: scientific article; zbMATH DE number 1767897