Cutting Barnette graphs perfectly is hard

DOI10.1007/978-3-031-43380-1_9arXiv2302.11667OpenAlexW4386974052MaRDI QIDQ6427329

Dibyayan Chakraborty, Julien Duron, Édouard Bonnet

Publication date: 22 February 2023

Full work available at URL: https://doi.org/10.1007/978-3-031-43380-1_9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius

This page was built for publication: Cutting Barnette graphs perfectly is hard