Counting independent sets in strongly orderable graphs

This is a preprint and may not have undergone formal peer review

Heinrich, M and Müller, H orcid.org/0000-0002-1123-1774 (2021) Counting independent sets in strongly orderable graphs. [Preprint - arXiv]

Abstract

Metadata

Item Type: Preprint
Authors/Creators:
Copyright, Publisher and Additional Information:

This is an open access preprint under the terms of the Creative Commons Attribution-Noncommercial-Sharealike 4.0 International Licence.

Dates:
  • Published: 6 January 2021
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Funding Information:
Funder
Grant number
EPSRC (Engineering and Physical Sciences Research Council)
EP/S016562/1
Depositing User: Symplectic Publications
Date Deposited: 12 Dec 2024 15:45
Last Modified: 13 Dec 2024 08:53
Published Version: https://arxiv.org/abs/2101.01997
Identification Number: 10.48550/arXiv.2101.01997
Open Archives Initiative ID (OAI ID):

Export

Statistics