On unique graph 3-colorability and parsimonious reductions in the plane-Reference-Cited by-同舟云学术

On unique graph 3-colorability and parsimonious reductions in the plane

Published:2004-06 Issue:1-3 Volume:319 Page:455-482
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Barbanchon Régis

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference16 articles.

1. R. Barbanchon, Planar Hamiltonian problems and linear parsimonious reductions, Tech. Report, Les Cahiers du GREYC 1, 2001 (postscript available at http://www.info.unicaen.fr/algo/publications).

2. R. Barbanchon, E. Grandjean, Local problems, planar local problems and linear time, in: Computer Science Logic, Lecture Notes in Computer Science, Vol. 2471, Springer, Berlin, 2002, pp. 397–411.

3. The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness;Creignou;Theoret. Comput. Sci.,1995

4. On generating all solutions of generalized satisfiability problems;Creignou;Inform. Théor. Appl.,1997

5. Complexity of generalized satisfiability counting problems;Creignou;Inform. Comput.,1996

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Clause-connected versions of the satisfiability problem;SIB ELECTRON MATH RE;2024

2. Coloring invariants of knots and links are often intractable;Algebraic & Geometric Topology;2021-08-11

3. Computational complexity and 3–manifolds and zombies;Geometry & Topology;2018-09-23

4. Some observations on holographic algorithms;computational complexity;2017-08-29

5. Some Observations on Holographic Algorithms;LATIN 2010: Theoretical Informatics;2010