Artículos de revistas

The Graph Sandwich Problem for P-4-sparse graphs

Registro en:
Discrete Mathematics. Elsevier Science Bv, v. 309, n. 11, n. 3664, n. 3673, 2009.
0012-365X
WOS:000266670000020
10.1016/j.disc.2008.01.014
Autor
Dantas, S
Klein, S
de Mello, CP
Morgana, A
Institución
Resumen
The P-4-sparse Graph Sandwich Problem asks, given two graphs G(1) = (V, E-1) and G(2) = (V, E-2), whether there exists a graph G = (V, E) such that E-1 subset of E subset of E-2 and G is P-4-sparse. In this paper we present a polynomial-time algorithm for solving the Graph Sandwich Problem for P-4-sparse graphs. (C) 2008 Elsevier B.V. All rights reserved.
 
309
 
11
 
SI
 
3664
 
3673
 
Materias

Mostrar el registro completo del ítem