| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9514550 | Electronic Notes in Discrete Mathematics | 2005 | 4 Pages |
Abstract
The P4-sparse Graph Sandwich Problem asks, given two graphs G1=(V,E1) and G2=(V,E2), whether there exists a graph G=(V,E) such that E1âEâE2 and G is P4-sparse. In this paper we present a polynomial-time algorithm for solving the Graph Sandwich Problem for P4-sparse graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
S. Dantas, S. Klein, C.P. de Mello, A. Morgana,