Barnette's conjecture through the lens of the Mod_k P complexity classes
From MaRDI portal
Publication:2695474
DOI10.1007/978-3-030-90048-9_6OpenAlexW3209751793MaRDI QIDQ2695474FDOQ2695474
Authors: Robert D. Barish, Akira Suyama 
Publication date: 31 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90048-9_6
Graph theory (including graph drawing) in computer science (68R10) Applications of game theory (91A80) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Reducibility among combinatorial problems
- The complexity of computing the permanent
- Title not available (Why is that?)
- The Complexity of Enumeration and Reliability Problems
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Title not available (Why is that?)
- The complexity of theorem-proving procedures
- Counting linear extensions
- PRIMES is in P
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
- Title not available (Why is that?)
- Edge reductions in cyclically \(k\)-connected cubic graphs
- NP is as easy as detecting unique solutions
- Inductive definition of two restricted classes of triangulations
- Title not available (Why is that?)
- On Hamiltonian Circuits
- #P-COMPLETENESS VIA MANY-ONE REDUCTIONS
- On the construction of parallel computers from various basis of Boolean functions
- Polytopes, graphs, and complexes
- Counting classes: Thresholds, parity, mods, and fewness
- Relations among MOD-classes
- Title not available (Why is that?)
- A note on 3-connected cubic planar graphs
- Computing and Combinatorics
- Construction of Barnette graphs whose large subgraphs are non-Hamiltonian
This page was built for publication: Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695474)
