The graph sandwich problem for 1-join composition is NP-complete-Reference-Cited by-同舟云学术

The graph sandwich problem for 1-join composition is NP-complete

Published:2002-09 Issue:1-3 Volume:121 Page:73-82
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

de Figueiredo Celina M.H.,Klein Sulamita,Vušković Kristina

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference21 articles.

1. Les problèmes de coloration en théorie des graphes;Berge;Publ. Inst. Statist. Univ. Paris,1960

2. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973. Translated from the French by Edward Minieka, North-Holland Mathematical Library, Vol. 6.

3. R.E. Bixby, A Composition for Perfect Graphs, Topics on perfect graphs, North-Holland, Amsterdam, 1984, pp. 221–224.

4. The homogeneous set sandwich problem;Cerioli;Inf. Process. Lett.,1998

5. A. Cournier, Sur quelques Algorithmes de Décomposition de Graphes, Thése Université Montpellier II, France, 1993.

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

1. Word-representability of graphs with respect to split recomposition;Discrete Applied Mathematics;2024-11

2. The Sandwich Problem for Decompositions and Almost Monotone Properties;Algorithmica;2018-01-19

3. The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem;Discrete Applied Mathematics;2015-02

4. The P versus NP–complete dichotomy of some challenging problems in graph theory;Discrete Applied Mathematics;2012-12

5. The external constraint 4 nonempty part sandwich problem;Discrete Applied Mathematics;2011-04