Cutting Barnette graphs perfectly is hard

Bonnet, É, Chakraborty, D. orcid.org/0000-0003-0534-6417 and Duron, J. (2024) Cutting Barnette graphs perfectly is hard. Theoretical Computer Science, 1010. 114701. ISSN 0304-3975

Abstract

Metadata

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

© 2024 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).

Keywords: Perfect matching; Cutset; Perfect matching set; Planar graphs; Barnette graphs; NP-completeness
Dates:
  • Published: 27 September 2024
  • Published (online): 19 June 2024
  • Accepted: 13 June 2024
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Algorithms & Complexity
Depositing User: Symplectic Publications
Date Deposited: 09 Jul 2024 10:46
Last Modified: 09 Jul 2024 10:46
Published Version: https://www.sciencedirect.com/science/article/pii/...
Status: Published
Publisher: Elsevier
Identification Number: 10.1016/j.tcs.2024.114701
Open Archives Initiative ID (OAI ID):

Export

Statistics