On decision and optimization (k,l)-graph sandwich problems-Reference-Cited by-同舟云学术

On decision and optimization (k,l)-graph sandwich problems

Published:2004-09 Issue:1-3 Volume:143 Page:155-165
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Dantas Simone,de Figueiredo Celina M.H.,Faria Luerbio

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference16 articles.

1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, in: Proceedings of the IEEE Symposium on Foundations of Computer Science—FOCS’92, 1992 pp. 14–23.

2. A. Brandstädt, Partitions of graphs into one or two independent sets and cliques, Report, Vol. 105, Informatik Berichte, Fern Universität, Hagen, Germany, 1991.

3. Partitions of graphs into one or two independent sets and cliques;Brandstädt;Discrete Math,1996

4. The complexity of some problems related to graph 3-colorability;Brandstädt;Discrete Appl. Math,1998

5. On coloring the nodes of a network;Brooks;Proc. Cambridge Philos. Soc,1941

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

1. Partitions and well-coveredness: The graph sandwich problem;Discrete Mathematics;2023-03

2. Edge clique partition in (k,ℓ)-graphs;Discrete Applied Mathematics;2022-01

3. Characterizations, probe and sandwich problems on (k,ℓ)-cographs;Discrete Applied Mathematics;2020-07

4. Chordal-(2,1) graph sandwich problem with boundary conditions;Electronic Notes in Discrete Mathematics;2018-08

5. The (k,ℓ)partitioned probe problem: NP-complete versus polynomial dichotomy;Discrete Applied Mathematics;2018-01