Thick Forests
Authors:
- Martin DyerMDMartin Dyer
- Haiko MüllerHMHaiko Müller
Open Access
- 8 January 2026
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 384, 177-200
Abstract
No abstract availableFunding Information
- Engineering and Physical Sciences Research Council
This publication has 34 references indexed in Scilit:
- Counting independent sets in graphs with bounded bipartite pathwidthRandom Structures & Algorithms, 2021
- Clique‐cutsets beyond chordal graphsJournal of Graph Theory, 2018
- Disjoint clique cutsets in graphs without long holesJournal of Graph Theory, 2005
- The Relative Complexity of Approximate Counting ProblemsAlgorithmica, 2003
- The complexity of counting graph homomorphismsRandom Structures & Algorithms, 2000
- The subchromatic number of a graphDiscrete Mathematics, 1989
- Geometric Algorithms and Combinatorial Optimization1988
- Decomposition by clique separatorsDiscrete Mathematics, 1985
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972