Chakraborty, Dibyayan, Bonnet, Édouard and Duron, Julien (2023) Cutting Barnette graphs perfectly is hard. In: Lecture Notes in Computer Science. 49th International Workshop on Graph-Theoretic Concepts in Computer Science, 28-30 Jun 2023, Fribourg, Switzerland. Lecture Notes in Computer Science, 14093 . Springer Nature , Cham, Switzerland , pp. 116-129. ISBN 978-3-031-43379-5
Abstract
A perfect matching cut is a perfect matching that is also a cutset, or equivalently a perfect matching containing an even number of edges on every cycle. The corresponding algorithmic problem, PERFECT MATCHING CUT, is known to be NP-complete in subcubic bipartite graphs [Le & Telle, TCS ’22] but its complexity was open in planar graphs and in cubic graphs. We settle both questions at once by showing that PERFECT MATCHING CUT is NP-complete in 3-connected cubic bipartite planar graphs or Barnette graphs. Prior to our work, among problems whose input is solely an undirected graph, only DISTANCE-2 4-COLORING was known NP-complete in Barnette graphs. Notably, HAMILTONIAN CYCLE would only join this private club if Barnette’s conjecture were refuted.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | This is an author produced version of a conference paper published in WG 2023: Graph-Theoretic Concepts in Computer Science. Uploaded in accordance with the publisher's self-archiving policy. |
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: | 12 Oct 2023 09:07 |
Last Modified: | 12 Oct 2023 09:07 |
Published Version: | https://link.springer.com/chapter/10.1007/978-3-03... |
Status: | Published |
Publisher: | Springer Nature |
Series Name: | Lecture Notes in Computer Science |
Identification Number: | 10.1007/978-3-031-43380-1_9 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:204183 |
Download
Filename: 2302.11667.pdf
