Journal Article10.48550/arxiv.2309.01482
Thick Forests
TL;DR: Thick forests are a subclass of perfect graphs that can be recognised in polynomial time.
read more
Abstract: We consider classes of graphs, which we call thick graphs, that have their vertices replaced by cliques and their edges replaced by bipartite graphs. In particular, we consider the case of thick forests, which are a subclass of perfect graphs. We show that this class can be recognised in polynomial time, and examine the complexity of counting independent sets and colourings for graphs in the class. We consider some extensions of our results to thick graphs beyond thick forests.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
The complexity of computing the permanent
TL;DR: It is shown that the permanent function of (0, 1)-matrices is a complete problem for the class of counting problems associated with nondeterministic polynomial time computations.
3.3K
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
TL;DR: Every minor-closed class of graphs that does not contain all planar graphs has a linear-time recognition algorithm that determines whether the treewidth of G is at most at most some constant $k$ and finds a tree-decomposition of G withtreewidth at most k.
Complexity of finding embeddings in a k -tree
TL;DR: This work determines the complexity status of two problems related to finding the smallest number k such that a given graph is a partial k-tree and presents an algorithm with polynomially bounded (but exponential in k) worst case time complexity.
1.4K
Algorithmic Aspects of Vertex Elimination on Graphs
TL;DR: A graph-theoretic elimination process which is related to performing Gaussian elimination on sparse symmetric positive definite systems of linear equations is considered, and it is conjecture that the problem of finding a minimum ordering is NP-complete.
1.4K
A partial k -arboretum of graphs with bounded treewidth
TL;DR: This survey paper wants to give an overview of many classes of graphs that can be seen to have a uniform upper bound on the treewidth of graphs in the class.
1.4K