This is a preprint and may not have undergone formal peer review
Dyer, M. and Müller, H. orcid.org/0000-0002-1123-1774 (2023) Thick Forests. [Preprint]
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.
Metadata
Item Type: | Preprint |
---|---|
Authors/Creators: |
|
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 03 Nov 2023 14:37 |
Last Modified: | 03 Nov 2023 14:37 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:204596 |
Download not available
A full text copy of this item is not currently available from White Rose Research Online